Antichains for the Automata-Based Approach to Model-Checking
From MaRDI portal
Publication:3623017
DOI10.2168/LMCS-5(1:5)2009zbMath1164.68021arXiv0902.3958OpenAlexW2073874233MaRDI QIDQ3623017
Laurent Doyen, Jean-François Raskin
Publication date: 29 April 2009
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0902.3958
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (11)
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata ⋮ Looking at mean payoff through foggy windows ⋮ Symbolic Model Checking in Non-Boolean Domains ⋮ A general language-based framework for specifying and verifying notions of opacity ⋮ On the power of finite ambiguity in Büchi complementation ⋮ Strategy construction for parity games with imperfect information ⋮ Unnamed Item ⋮ Coinductive Algorithms for Büchi Automata ⋮ Unnamed Item ⋮ State of Büchi Complementation ⋮ Random Models for Evaluating Efficient Büchi Universality Checking
Uses Software
This page was built for publication: Antichains for the Automata-Based Approach to Model-Checking
