Deciding bisimilarity between BPA and BPP processes.

DOI10.1007/B11938MaRDI QIDQ5900564zbMATH OpenOpenAlexFDO

Authors Petr Jančar, Antonin Kučera, Faron Moller

Publication date 30 March 2010

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

Full work available at URL https://doi.org/10.1007/b11938

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1231554
• Comparing expressibility of normed BPA and normed BPP processes
• scientific article; zbMATH DE number 1232243
• Normed BPA vs. Normed BPP Revisited
• Complexity of deciding bisimilarity between normed BPA and normed BPP

Cited in

(7)

• Comparing expressibility of normed BPA and normed BPP processes
• Complexity of deciding bisimilarity between normed BPA and normed BPP
• Complexity of checking bisimilarity between sequential and parallel processes
• Selected Ideas Used for Decidability and Undecidability of Bisimilarity
• Deciding Bisimilarity of Full BPA Processes Locally
• Normed BPA vs. Normed BPP Revisited
• Basic process algebra with deadlocking states

This page was built for publication: Deciding bisimilarity between BPA and BPP processes.

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