Bisimulation and action refinement

DOI10.1016/0304-3975(93)90157-OzbMath0778.68060MaRDI QIDQ685407

Walter Vogler

Publication date: 17 October 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

concurrent systemsbisimulationtrue concurrencyAction refinementsilent moves

Mathematics Subject Classification ID

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

Related Items

Deciding true concurrency equivalences on safe, finite nets, Contextual equivalences in configuration structures and reversibility, The difference between splitting in \(n\) and \(n+1\), Action refinement and property inheritance in systems of sequential agents, A reduced maximality labeled transition system generation for recursive Petri nets, Team equivalences for finite-state machines with silent moves, The limit of splitn-language equivalence, Maximality preserving bisimulation, Unnamed Item, Symmetric and Asymmetric Asynchronous Interaction, New Bisimulation Semantics for Distributed Systems, ENFORCING CONCURRENT TEMPORAL BEHAVIORS, Towards a unified view of bisimulation: A comparative study, Vertical implementation, Pomset bisimulation and unfolding for reset Petri nets

Cites Work

• Failures semantics based on interval semiwords is a congruence for refinement
• Calculi for synchrony and asynchrony
• On interprocess communication. I: Basic formalism
• Modeling concurrency with partial orders
• Petri nets, event structures and domains. I
• Maximality preserving bisimulation
• Concurrent bisimulations in Petri nets
• Algebraic laws for nondeterminism and concurrency
• Advances in Petri nets 1992
• 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
• Unnamed Item