scientific article; zbMATH DE number 1860681

MaRDI QIDQ4790409zbMATH OpenFDO

Authors Olaf Burkart, Javier Esparza

Publication date 2001

zbMATH Keywords

concurrencyinfinite-state systems

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 1231559
• scientific article; zbMATH DE number 1064110
• Infinite results
• scientific article; zbMATH DE number 1944387
• scientific article; zbMATH DE number 2155191
• More infinity for a better finitism

Cited in

(11)

• On the complexity of the linear-time μ-calculus for Petri Nets
• A decidability result for the model checking of infinite-state systems
• scientific article; zbMATH DE number 2155191 (Why is no real title available?)
• Well-structured transition systems everywhere!
• Equivalence-checking with infinite-state systems: techniques and results
• The regular viewpoint on PA-processes
• Tableau methods for PA-processes
• Complete SAT-Based Model Checking for Context-Free Processes
• Infinite results
• COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES
• Decidability of weak bisimilarity for a subset of BPA

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 Q4790409)