scientific article; zbMATH DE number 1927587

MaRDI QIDQ4484512zbMATHFDO

Authors Jiří Srba

Publication date 12 June 2003

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1948498
• Refining the undecidability border of weak bisimilarity
• Completeness results for undecidable bisimilarity problems
• scientific article; zbMATH DE number 1701362
• scientific article; zbMATH DE number 1232243

Cited in

(16)

• Foundations of Software Science and Computation Structures
• The complexity of bisimilarity-checking for one-counter processes.
• Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
• Refining the undecidability border of weak bisimilarity
• Undecidability of accordance for open systems with unbounded message queues
• On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two
• scientific article; zbMATH DE number 1361133 (Why is no real title available?)
• scientific article; zbMATH DE number 2038739 (Why is no real title available?)
• Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
• scientific article; zbMATH DE number 2163042 (Why is no real title available?)
• Completeness results for undecidable bisimilarity problems
• On the computational complexity of bisimulation, redux
• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
• scientific article; zbMATH DE number 1948498 (Why is no real title available?)
• Undecidability of bisimilarity by defender's forcing

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