scientific article; zbMATH DE number 2155191

zbMath1065.68073MaRDI QIDQ4665738

Jiří Srba

Publication date: 11 April 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

infinite-state systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Bisimulation equivalence and regularity for real-time one-counter automata ⋮ Bisimilarity of Diagrams ⋮ Theory of interaction ⋮ Simulation relations and applications in formal methods ⋮ Equivalence of pushdown automata via first-order grammars ⋮ Complexity of deciding bisimilarity between normed BPA and normed BPP ⋮ Selected Ideas Used for Decidability and Undecidability of Bisimilarity ⋮ Normed BPA vs. Normed BPP Revisited ⋮ Decidability of branching bisimulation on normed commutative context-free processes ⋮ On Decidability of LTL+Past Model Checking for Process Rewrite Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence ⋮ Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes ⋮ Optimally Resilient Strategies in Pushdown Safety Games ⋮ Bisimilarity on basic parallel processes ⋮ Non-interleaving bisimulation equivalences on basic parallel processes