Jan K. Pachl

According to our database, Jan K. Pachl authored at least 29 papers between 1981 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2003

Reachability problems for communicating finite state machines

Jan K. Pachl

CoRR, 2003

2002

The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy.

Stephen A. Cook, Jan K. Pachl, Irwin S. Pressman

Distributed Comput., 2002

1999

Computation in an algebra of test selection criteria

Jan K. Pachl, Shmuel Zaks

CoRR, 1999

1997

Wang Tilings and Distributed Verification on Anonymous Torus Networks.

Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl

Theory Comput. Syst., 1997

1994

A Proof of Protocol Correctness.

Jan K. Pachl

RAIRO Theor. Informatics Appl., 1994

A Distributed System Architecture for a Distributed Application Environment.

Michael A. Bauer, Neil Coburn, Doreen L. Erickson, Patrick J. Finnigan, James W. Hong, Per-Åke Larson, Jan K. Pachl, Jacob Slonim, David J. Taylor, Toby J. Teorey

IBM Syst. J., 1994

1993

The per-process view of naming and remote execution.

Sanjay R. Radia, Jan K. Pachl

IEEE Parallel Distributed Technol. Syst. Appl., 1993

Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract).

Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl

Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

Coherence in Naming in Distributed Computing Environments.

Sanjay R. Radia, Jan K. Pachl

Proceedings of the 13th International Conference on Distributed Computing Systems, 1993

An integrated distributed systems management architecture.

Michael A. Bauer, Patrick J. Finnigan, James W. Hong, Jan K. Pachl, Toby J. Teorey

Proceedings of the 1993 Conference of the Centre for Advanced Studies on Collaborative Research, 1993

Operation jump start: a CORDS integration prototype using DCE.

Gopi K. Attaluri, Dexter P. Bradshaw, Patrick J. Finnigan, Nigel Hinds, Michael H. Kalantar, Kelly A. Lyons, Andrew D. Marshall, Jan K. Pachl, Hong Tran

Proceedings of the 1993 Conference of the Centre for Advanced Studies on Collaborative Research, 1993

1992

Corrigendum: A Simple Proof of a Completeness Result for Leads-To in the UNITY Logic.

Jan K. Pachl

Inf. Process. Lett., 1992

A Simple Proof of a Completeness Result for leads-to in the UNITY Logic.

Jan K. Pachl

Inf. Process. Lett., 1992

The optimal placement of replicas in a network using a read any - write all policy.

Irwin S. Pressman, Stephen A. Cook, Jan K. Pachl

Proceedings of the 1992 Conference of the Centre for Advanced Studies on Collaborative Research, 1992

Directory requirements for a multidatabase service.

T. Patrick Martin, Michael A. Bauer, Neil Coburn, Per-Åke Larson, Gerald Neufeld, Jan K. Pachl, Jacob Slonim

Proceedings of the 1992 Conference of the Centre for Advanced Studies on Collaborative Research, 1992

1991

Analysis of Toggle Protocols.

Jan K. Pachl

Distributed Comput., 1991

1990

A notation for specifying test selection criteria.

Jan K. Pachl

Proceedings of the Protocol Specification, 1990

1989

Uniform Self-Stabilizing Rings.

James E. Burns, Jan K. Pachl

ACM Trans. Program. Lang. Syst., 1989

On the Limit Sets of Cellular Automata.

Karel Culík II, Jan K. Pachl, Sheng Yu

SIAM J. Comput., 1989

1988

Two Livelock-Free Protocols for Slotted Rings.

Jan K. Pachl

Comput. J., 1988

1987

A Lower Bound for Probabilistic Distributed Algorithms.

Jan K. Pachl

J. Algorithms, 1987

A Robust Ring Transmission Protocol.

Jan K. Pachl, Liam Casey

Comput. Networks, 1987

A Distributed Ring Orientation Algorithm (Preliminary Version).

Violet R. Syrotiuk, Jan K. Pachl

Proceedings of the Distributed Algorithms, 1987

Protocol Description and Analysis Based on a State Transition Model with Channel Expressions.

Jan K. Pachl

Proceedings of the Protocol Specification, 1987

1984

Finding Pseudoperipheral Nodes in Graphs.

Jan K. Pachl

J. Comput. Syst. Sci., 1984

Lower Bounds for Distributed Maximum-Finding Algorithms.

Jan K. Pachl, Ephraim Korach, Doron Rotem

J. ACM, 1984

1982

A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms

Jan K. Pachl, Ephraim Korach, Doron Rotem

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

Folding and Unrolling Systolic Arrays (Preliminary Version).

Karel Culík II, Jan K. Pachl

Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

1981

Equivalence Problems for Mappings on Infinite Strings

Karel Culík II, Jan K. Pachl

Inf. Control., April, 1981