Refinement of actions in event structures and causal trees

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)

zbMATH Keywords

modelstrue concurrencyprocess algebrasaction refinementevent structurescausal trees

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Well-behaved flow event structures for parallel composition and action refinement, Towards refinable choreographies, Concurrent testing of processes, Event structure semantics for multiparty sessions, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, Action refinement and property inheritance in systems of sequential agents, A reduced maximality labeled transition system generation for recursive Petri nets, Unnamed Item, Testing equivalences of time Petri nets, Causality versus true-concurrency, Unnamed Item, Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice, Towards a unified view of bisimulation: A comparative study, Dynamic connectors for concurrency

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