Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
From MaRDI portal
Publication:2638769
DOI10.1016/0304-3975(91)90333-WzbMath0717.68029MaRDI QIDQ2638769
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (6)
When is partial trace equivalence adequate? ⋮ Step bisimulation is pomset equivalence on a parallel language without explicit internal choice ⋮ The difference between splitting in \(n\) and \(n+1\) ⋮ Rule formats for determinism and idempotence ⋮ Unnamed Item ⋮ Denotational, causal, and operational determinism in event structures
Cites Work
- Algèbre de processus et synchronisation
- Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
- Algebra of communicating processes with abstraction
- Modeling concurrency with partial orders
- Sequential and concurrent behaviour in Petri net theory
- Concurrency and atomicity
- A calculus of communicating systems
- Petri nets, event structures and domains. I
- Axiomatising Finite Concurrent Processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)