Equivalence-Checking with Infinite-State Systems: Techniques and Results

DOI10.1007/3-540-36137-5_3zbMath1278.68218OpenAlexW1591409444MaRDI QIDQ3085977

Petr Jančar, Antonín Kučera

Publication date: 1 April 2011

Published in: SOFSEM 2002: Theory and Practice of Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-36137-5_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Simulation relations and applications in formal methods ⋮ On the computational complexity of bisimulation, redux

Uses Software

• Automath

This page was built for publication: Equivalence-Checking with Infinite-State Systems: Techniques and Results