• Bounded model checking for wea...

Result: Bounded model checking for weak alternating büchi automata

Title:
Bounded model checking for weak alternating büchi automata
Authors:
HELJANKO, Keijo, JUNTTILA, Tommi, KEINÄNEN, Misa, LANGE, Martin, LATVALA, Timo
Source:
Computer aided verification (18th international conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006)0CAV 2006. :95-108
Publisher Information:
Berlin; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 22 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Traitement des langages et microprogrammation, Language processing and microprogramming, Génie logiciel, Software engineering, Automate Büschi, Büschi automata, Autómata Büschi, Langage rationnel, Regular language, Lenguaje racional, Langage spécification, Specification language, Lenguaje especificación, Logique propositionnelle, Propositional logic, Lógica proposicional, Vérification modèle, Model checking, Verificación modelo, Vérification programme, Program verification, Verificación programa, Automate alternant, Alternating automata, Autómata alternante
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Laboratory for Theoretical Computer Science Helsinki University of Technology P.O. Box 5400, 02015, Finland
Institut für Informatik Ludwig -Maximilians -Universität München, Germany
Department of Computer Science, University of Illinois at Urbana-Champaign, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19150346
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19150346
Database:
PASCAL Archive

Further Information

We present an incremental bounded model checking encoding into propositional satisfiability where the property specification is expressed as a weak alternating Büchi automaton (WABA). The encoding is linear in the specification, or, more exactly 0(|I| + k.|T| + k .|8|), where |I| is the size of the initial state predicate, k is the bound, |T| is the size of the transition relation, and |δ| is the size of the WABA transition relation. Minimal length counterexamples can also be found by increasing the encoding size to be quadratic in the number of states in the largest component of the WABA. The proposed encoding can be used to implement more efficient bounded model checking algorithms for ω-regular industrial specification languages such as Accellera's Property Specification Language (PSL). Encouraging experimental results on a prototype implementation are reported.