The decidability border of hereditary history preserving bisimilarity

DOI10.1016/J.IPL.2004.11.010zbMath1173.68538OpenAlexW2084295474MaRDI QIDQ835053

Sibylle Fröschle

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.11.010

zbMATH Keywords

concurrencybisimulation gamesinfinite-space verificationtrue-concurrency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems ⋮ Logics and Bisimulation Games for Concurrency, Causality and Conflict ⋮ Non-interleaving bisimulation equivalences on basic parallel processes

Cites Work

• On undecidability of propositional temporal logics on trace systems
• Deciding true concurrency equivalences on safe, finite nets
• Undecidability of domino games and hhp-bisimilarity.
• Mathematical Foundations of Computer Science 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The decidability border of hereditary history preserving bisimilarity