Step bisimulation is pomset equivalence on a parallel language without explicit internal choice

[1]  Matthew Hennessy,et al.  Distributed bisimulations , 1989, JACM.

[2]  Alan Burns,et al.  Concurrent programming , 1980, Operating Systems Engineering.

[3]  Ernst-Rüdiger Olderog,et al.  Nets, terms and formulas , 1991 .

[4]  Lucia Pomello,et al.  Some equivalence notions for concurrent systems. An overview , 1985, Applications and Theory in Petri Nets.

[5]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[6]  Ilaria Castellani,et al.  On the Semantics of Concurrency: Partial Orders and Transition Systems , 1987, TAPSOFT, Vol.1.

[7]  Rob J. van Glabbeek,et al.  Petri Net Models for Algebraic Theories of Concurrency , 1987, PARLE.

[8]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[9]  Walter Vogler,et al.  The Step Failure Semantics , 1987, STACS.

[10]  Alan Mycroft,et al.  On the Relationship of CCS and Petri Nets , 1984, ICALP.

[11]  Ursula Goltz,et al.  Equivalences and Refinement , 1990, Semantics of Systems of Concurrent Processes.

[12]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[13]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[14]  C. A. R. Hoare,et al.  A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.

[15]  Ursula Goltz,et al.  Refinement of Actions in Causality Based Models , 1990, REX Workshop.

[16]  R. M. McKeag,et al.  On the Construction of Programs , 1980 .

[17]  Jay Loren Gischer,et al.  Partial orders and the axiomatic theory of shuffle (pomsets) , 1985 .

[18]  Luca Aceto,et al.  Full Abstraction for Series-Parallel Pomsets , 1991, TAPSOFT, Vol.1.

[19]  Frits W. Vaandrager,et al.  Determinism - (Event Structure Isomorphism = Step Sequence Equivalence) , 1991, Theor. Comput. Sci..

[20]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[21]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

[22]  Stephen L. Bloom,et al.  Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes , 1979, Theor. Comput. Sci..

[23]  Ernst-Rüdiger Olderog,et al.  Strong bisimilarity on nets: a new concept for comparing net semantics , 1988, REX Workshop.

[24]  Dirk Taubner,et al.  Finite Representations of CCS and TCSP Programs by Automata and Petri Nets , 1989, Lecture Notes in Computer Science.

[25]  Robin Milner,et al.  Four combinators for concurrency , 1982, PODC '82.

[26]  Maurice Nivat,et al.  The metric space of infinite trees. Algebraic and topological properties , 1980, Fundam. Informaticae.

[27]  Ralph Tindell.  Covering Morphisms and Unique Minimal D-Schemes , 1991, Acta Cybern..

[28]  Dirk A. Taubner,et al.  Finite Reresentations of CCS and TCSP Programs by Automata and Petri Nets , 1989, Lecture Notes in Computer Science.

[29]  George J. Milne,et al.  CIRCAL and the representation of communication, concurrency, and time , 1985, TOPL.

[30]  C. C. Elgot,et al.  A semantically meaningful characterization of reducible flowchart schemes , 1979 .

[31]  David Murphy,et al.  Timed Process Algebra, Petri Nets, and Event Refinement , 1991 .

[32]  Ursula Goltz.  CCS and Petri Nets , 1990, Semantics of Systems of Concurrent Processes.

[33]  P. S. Thiagarajan,et al.  Degrees of Non-Determinism and Concurrency: A Petri Net View , 1984, FSTTCS.

[34]  Ugo Montanari,et al.  Concurrent Histories: A Basis for Observing Distributed Systems , 1987, J. Comput. Syst. Sci..

[35]  Raymond R. Devillers.  Maximality preservation and the ST-idea for action refinements , 1992, Advances in Petri Nets: The DEMON Project.

[36]  Ernst-Rüdiger Olderog,et al.  Operational Petri net semantics for CCSP , 1986, European Workshop on Applications and Theory of Petri Nets.

[37]  Robin Milner,et al.  A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..