Folk Theorems on the Correspondence between State-Based and Event-Based Systems

DOI10.1007/978-3-642-18381-2_41zbMath1298.68195arXiv1011.0136OpenAlexW3123595139MaRDI QIDQ3075540

Michel Reniers, Tim A. C. Willemse

Publication date: 15 February 2011

Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.0136

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizing finite Kripke structures in propositional temporal logic
• Branching Bisimilarity with Explicit Divergence
• Three logics for branching bisimulation
• Branching time and abstraction in bisimulation semantics
• An action-based framework for veryfying logical and behavioural properties of concurrent systems

This page was built for publication: Folk Theorems on the Correspondence between State-Based and Event-Based Systems