scientific article; zbMATH DE number 1927587

zbMATH Open1012.68138MaRDI QIDQ4484512FDOQ4484512

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

Title of this publication is not available (Why is that?)

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

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)

Cited In (15)

• Undecidability of accordance for open systems with unbounded message queues
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of bisimilarity-checking for one-counter processes.
• Undecidability of bisimilarity by defender's forcing
• On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two
• On the computational complexity of bisimulation, redux
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
• 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
• Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
• Title not available (Why is that?)
• Completeness results for undecidable bisimilarity problems
• Foundations of Software Science and Computation Structures
• Title not available (Why is that?)

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)