Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
From MaRDI portal
Recommendations
Cites work
- A complete inference system for a class of regular behaviours
- A semantically meaningful characterization of reducible flowchart schemes
- Algebraic and graph theoretic characterizations of structured flowchart schemes
- CIRCAL and the representation of communication, concurrency, and time
- Communicating sequential processes
- Concurrent bisimulations in Petri nets
- Concurrent histories: a basis for observing distributed systems
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
- Distributed bisimulations
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- Modeling concurrency with partial orders
- On lifting Fuchsian Groups
- Petri nets, event structures and domains. I
- Process algebra for synchronous communication
Cited in
(3)
This page was built for publication: Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4279248)