When Simulation Meets Antichains
From MaRDI portal
Publication:3557075
DOI10.1007/978-3-642-12002-2_14zbMath1284.68337OpenAlexW1543741569MaRDI QIDQ3557075
Tomáš Vojnar, Lukáš Holík, Yu-Fang Chen, Richard Mayr, Parosh Aziz Abdulla
Publication date: 27 April 2010
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12002-2_14
Related Items (17)
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata ⋮ Algorithms for Kleene algebra with converse ⋮ Symbolic automata for representing big code ⋮ Correct and efficient antichain algorithms for refinement checking ⋮ Forest automata for verification of heap manipulation ⋮ Nested antichains for WS1S ⋮ Lazy Automata Techniques for WS1S ⋮ Fair Termination for Parameterized Probabilistic Concurrent Systems ⋮ Up-To Techniques for Weighted Systems ⋮ Coinductive Algorithms for Büchi Automata ⋮ Strategy synthesis for multi-dimensional quantitative objectives ⋮ State of Büchi Complementation ⋮ Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure ⋮ Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure ⋮ Abstraction refinement and antichains for trace inclusion of infinite state systems ⋮ Advanced Ramsey-Based Büchi Automata Inclusion Testing ⋮ Unnamed Item
This page was built for publication: When Simulation Meets Antichains
