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

DOI10.1017/S0960129500000116zbMath0806.68044MaRDI QIDQ4279248

Douglas R. Troeger

Publication date: 16 February 1994

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

concurrency modelspomset equivalencestep bisimulation equivalence

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (3)

An equational axiomatization for multi-exit iteration ⋮ The equational logic of fixed points ⋮ A Finite Axiomatization of Nondeterministic Regular Expressions

Cites Work

• Unnamed Item
• A complete inference system for a class of regular behaviours
• Concurrent histories: a basis for observing distributed systems
• Modeling concurrency with partial orders
• Petri nets, event structures and domains. I
• A semantically meaningful characterization of reducible flowchart schemes
• Algebraic and graph theoretic characterizations of structured flowchart schemes
• Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
• Concurrent bisimulations in Petri nets
• Distributed bisimulations
• CIRCAL and the representation of communication, concurrency, and time
• Process algebra for synchronous communication
• On lifting Fuchsian Groups
• Communicating sequential processes

This page was built for publication: Step bisimulation is pomset equivalence on a parallel language without explicit internal choice