Weak bisimulation and model checking for basic parallel processes

DOI10.1007/3-540-62034-6_40MaRDI QIDQ6567759zbMATH OpenFDO

Authors Richard M. Mayr

Publication date 5 July 2024

zbMATH Keywords

model checkingbisimulationbasic parallel processes

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

• scientific article; zbMATH DE number 1701362
• Publication:4490743
• More on Weak Bisimilarity of Normed Basic Parallel Processes
• scientific article; zbMATH DE number 1670835
• Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1555184 (Why is no real title available?)
• Petri nets, commutative context-free grammars, and basic parallel processes
• Undecidability of bisimilarity for Petri nets and some related problems

This page was built for publication: Weak bisimulation and model checking for basic parallel processes

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