Improved Algorithms for the Automata-Based Approach to Model-Checking
From MaRDI portal
Publication:5758127
DOI10.1007/978-3-540-71209-1_34zbMath1186.68285OpenAlexW1846242859MaRDI QIDQ5758127
Laurent Doyen, Jean-François Raskin
Publication date: 3 September 2007
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-540-71209-1_34
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes, Profile trees for Büchi word automata, with application to determinization, Fixed point guided abstraction refinement for alternating automata, Linear temporal logic symbolic model checking, Coinductive Algorithms for Büchi Automata, Büchi Complementation and Size-Change Termination, Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking, Advanced Ramsey-Based Büchi Automata Inclusion Testing, Fixpoint Guided Abstraction Refinement for Alternating Automata
Uses Software
