Expansive-Bisimulation for Context-Free Processes

DOI10.1007/978-3-540-75221-9_22MaRDI QIDQ3526944zbMATH OpenOpenAlexFDO

Authors Xin Xin Liu

Publication date 25 September 2008

Published in Formal Methods and Hybrid Real-Time Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75221-9_22

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• An elementary bisimulation decision procedure for arbitrary context-free processes
• Actions speak louder than words: proving bisimilarity for context-free processes
• Bisimulation equivalence is decidable for all context-free processes
• Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
• Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)

Cited in

(2)

• Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
• Extended transition systems for parametric bisimulation

This page was built for publication: Expansive-Bisimulation for Context-Free Processes

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