Hereditary history preserving bisimulation is decidable for trace-labelled systems

DOI10.1007/3-540-36206-1_26MaRDI QIDQ4415263zbMATH OpenFDO

Authors Madhavan Mukund

Publication date 28 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2556/25560289.htm

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On plain and hereditary history-preserving bisimulation
• CONCUR 2005 – Concurrency Theory
• scientific article; zbMATH DE number 1497782
• Hereditary History-Preserving Bisimilarity: Logics and Automata
• scientific article; zbMATH DE number 7559463
• Minimal transition systems for history-preserving bisimulation
• A logic with reverse modalities for history-preserving bisimulations
• Hereditary history preserving bisimilarity is undecidable
• History preserving bisimulation for contextual nets
• Deciding bisimulation and trace equivalences for systems with many identical processes

Cited in

(8)

• Undecidability of domino games and hhp-bisimilarity.
• Hereditary History-Preserving Bisimilarity: Logics and Automata
• scientific article; zbMATH DE number 1497782 (Why is no real title available?)
• Hereditary history preserving bisimilarity is undecidable
• On plain and hereditary history-preserving bisimulation
• Minimal transition systems for history-preserving bisimulation
• CONCUR 2005 – Concurrency Theory
• The decidability border of hereditary history preserving bisimilarity

This page was built for publication: Hereditary history preserving bisimulation is decidable for trace-labelled systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4415263)