scientific article; zbMATH DE number 5604065

MaRDI QIDQ3395948zbMATH OpenFDO

Authors Jiří Srba

Publication date 15 September 2009

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)

Cited in

(7)

• Reachability is decidable for weakly extended process rewrite systems
• Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
• A general approach to comparing infinite-state systems with their finite-state specifications
• Decidability of weak bisimilarity for a subset of 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 Q3395948)