Mathematical Foundations of Computer Science 2003

DOI10.1007/B11836MaRDI QIDQ5431340zbMATH OpenOpenAlexFDO

Authors Sławomir Lasota

Publication date 7 December 2007

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

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Non-interleaving bisimulation equivalences on basic parallel processes
• Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time
• scientific article; zbMATH DE number 1361133
• scientific article; zbMATH DE number 1051237
• Complexity of deciding bisimilarity between normed BPA and normed BPP

Cited in

(9)

• Non-interleaving bisimulation equivalences on basic parallel processes
• Decidability of performance equivalence for basic parallel processes
• Causality, behavioural equivalences, and the security of cyberphysical systems
• scientific article; zbMATH DE number 1512608 (Why is no real title available?)
• Undecidability of performance equivalence of Petri nets
• Normed processes, unique decomposition, and complexity of bisimulation equivalences
• Applying Formal Methods: Testing, Performance, and M/E-Commerce
• A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
• The decidability border of hereditary history preserving bisimilarity

This page was built for publication: Mathematical Foundations of Computer Science 2003

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