Refinement of actions in event structures and causal trees
From MaRDI portal
Publication:688717
DOI10.1016/0304-3975(93)90361-VzbMath0805.68041MaRDI QIDQ688717
Pierpaolo Degano, Philippe Darondeau
Publication date: 6 December 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice, Towards a unified view of bisimulation: A comparative study, Dynamic connectors for concurrency, Well-behaved flow event structures for parallel composition and action refinement, Concurrent testing of processes, Causality versus true-concurrency, Unnamed Item, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
Cites Work
- Petri nets, algebras, morphisms, and compositionality
- Concurrency and atomicity
- A calculus of communicating systems
- Petri nets, event structures and domains. I
- Algebraic laws for nondeterminism and concurrency
- Axiomatising Finite Concurrent Processes
- Termination, deadlock, and divergence
- Branching time and abstraction in bisimulation semantics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item