scientific article; zbMATH DE number 2086665

MaRDI QIDQ4737202zbMATH OpenFDO

Authors Jiří Srba

Publication date 11 August 2004

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 2086414
• Strong bisimilarity of simple process algebras: Complexity lower bounds
• Complexity of Weak Bisimilarity and Regularity for BPA and BPP
• Complexity of weak bisimilarity and regularity for BPA and BPP
• scientific article; zbMATH DE number 1670835

Cited in

(14)

• The complexity of bisimilarity-checking for one-counter processes.
• Strong bisimilarity of simple process algebras: Complexity lower bounds
• Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
• Complexity of deciding bisimilarity between normed BPA and normed BPP
• Bisimulation equivalence and regularity for real-time one-counter automata
• scientific article; zbMATH DE number 1670835 (Why is no real title available?)
• Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
• Normed BPA vs. Normed BPP Revisited
• scientific article; zbMATH DE number 2080931 (Why is no real title available?)
• scientific article; zbMATH DE number 2086414 (Why is no real title available?)
• Convenient category of processes and simulations I: Modulo strong bisimilarity
• Two lower bounds for BPA
• On the computational complexity of bisimulation, redux
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes

This page was built for publication:

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