Equivalence-checking on infinite-state systems: Techniques and results
From MaRDI portal
Publication:5476389
DOI10.1017/S1471068406002651zbMath1101.68700OpenAlexW2067785662MaRDI QIDQ5476389
Publication date: 14 July 2006
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068406002651
Related Items (9)
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata ⋮ Characteristic invariants in Hennessy-Milner logic ⋮ Theory of interaction ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ Correcting a Space-Efficient Simulation Algorithm ⋮ Selected Ideas Used for Decidability and Undecidability of Bisimilarity ⋮ Hardness of preorder checking for basic formalisms ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes ⋮ Unnamed Item
This page was built for publication: Equivalence-checking on infinite-state systems: Techniques and results