Filters








1,002 Hits in 4.7 sec

Bounded Model Checking for Weak Alternating Büchi Automata [chapter]

Keijo Heljanko, Tommi Junttila, Misa Keinänen, Martin Lange, Timo Latvala
2006 Lecture Notes in Computer Science  
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 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  ...  Tauriainen for interesting discussions and pointers on the topic. Thanks also to R. Bloem and other contributors of the Prosyd project for their freely available PSL translation tool as well as A.  ... 
doi:10.1007/11817963_12 fatcat:auy4iqgjrbay3erq77md7r76i4

Bounded Model Checking with SNF, Alternating Automata, and Büchi Automata

Daniel Sheridan
2005 Electronical Notes in Theoretical Computer Science  
In this paper we give a new bounded model checking encoding using alternating automata and focus on the relationship between alternating automata and SNF.  ...  Model checking of LTL formulae is traditionally carried out by a conversion to Büchi automata, and there is therefore a large body of research in this area including some recent studies on the use of alternating  ...  Bounded Model Checking with Alternating Automata The encoding of alternating automata is very similar to Büchi automata.  ... 
doi:10.1016/j.entcs.2004.12.024 fatcat:5y4fyu5xardezpvu4h2fitvs7q

Quasi-Weak Cost Automata: A New Variant of Weakness

Denis Kuperberg, Michael Vanden Boom, Marc Herbstritt
2011 Foundations of Software Technology and Theoretical Computer Science  
Unlike traditional weak automata which have a hard-coded bound on the number of alternations between accepting and rejecting states, quasi-weak automata bound the alternations using the counter values  ...  The main result is a Rabin-style characterization theorem: a function is quasi-weak definable if and only if it is definable using two dual forms of nondeterministic Büchi cost automata.  ...  Acknowledgements We are grateful to Thomas Colcombet for having made this joint work possible, and for many helpful discussions.  ... 
doi:10.4230/lipics.fsttcs.2011.66 dblp:conf/fsttcs/KuperbergB11 fatcat:navlbpcpknfurjzvkw5kgpjznq

Reasoning About Co–Büchi Tree Automata [chapter]

Salvatore La Torre, Aniello Murano
2005 Lecture Notes in Computer Science  
We first prove that for alternating generalized co-Büchi tree automata the simulation theorem does not hold and the generalized acceptance does not add to the expressive power of the model.  ...  co-Büchi tree automata that yields an algorithm for checking the emptiness that takes time linear in the product of the number of states and the number of sets in the acceptance condition.  ...  Let For the lower bound, we observe that each weak alternating Büchi tree automaton A can be translated into a language equivalent alternating co-Büchi tree automaton by simply interpreting its acceptance  ... 
doi:10.1007/978-3-540-31862-0_37 fatcat:xyygpeb3dvgbdawjkest4alnp4

Automatic Abstraction Using Generalized Model Checking [chapter]

Patrice Godefroid, Radha Jagadeesan
2002 Lecture Notes in Computer Science  
We study the cost needed to improve precision by presenting new upper and lower bounds for the complexity of generalized model checking in the size of the abstraction.  ...  Generalized model checking is a framework for reasoning about partial state spaces of concurrent reactive systems.  ...  For basic notions of automata theory (including definitions of nondeterministic/alternating/weak Büchi automata on words and trees), please refer to [18] .  ... 
doi:10.1007/3-540-45657-0_11 fatcat:pq2p3k4hgjcvbef35ziwvs3kta

Omega Automata and its Classes

Natasha Singh, Ajay Kumar
2018 Current Science  
ω-automata is a variant of finite automata which accepts infinite strings.  ...  A variety of conditions are used to represent the set of accepting strings in ω-automata. This paper summarizes various types of ω-automata, their transition functions and accepting conditions.  ...  He proposed a bounded model checking using alternating automata and explored the difference between alternating, Büchi automata and SNF in terms of their applicability.  ... 
doi:10.18520/cs/v115/i11/2042-2051 fatcat:byu5hbxpnbaclbp2rkx3qa6uhm

An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking [chapter]

Rotem Oshman
2008 Lecture Notes in Computer Science  
Bounded model-checking is a technique for finding bugs in very large designs.  ...  In this paper we develop a theoretic framework for dynamic completeness criteria based on alternating Büchi automata.  ...  The author is grateful to Orna Grumberg, Yoram Moses and Avi Yadgar for many fruitful discussions.  ... 
doi:10.1007/978-3-540-93900-9_23 fatcat:aubfjw6wb5ehpidxlry7tlhhea

Deeper Connections Between LTL and Alternating Automata [chapter]

Radek Pelánek, Jan Strejček
2006 Lecture Notes in Computer Science  
It is known that Linear Temporal Logic (LTL) has the same expressive power as alternating 1-weak automata (A1W automata, also called alternating linear automata or very weak alternating automata).  ...  The second part of the paper draws a direct connection between fragments of the Until-Release hierarchy [4] and alternation depth of nonaccepting and accepting states in A1W automata.  ...  Only a few years ago, the alternating 1-weak Büchi automata (or A1W automata for short, also known as alternating linear automata or very weak alternating automata) have been identified as the type of  ... 
doi:10.1007/11605157_20 fatcat:p2vdeufqc5buhiagqt5vewqfqm

Alternating Weak Automata from Universal Trees [article]

Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen
2019 arXiv   pre-print
An improved translation from alternating parity automata on infinite words to alternating weak automata is given.  ...  Any slightly better such translation would (if---like all presently known such translations---it is efficiently constructive) lead to algorithms for solving parity games that are asymptotically faster  ...  For instance, the emptiness check for alternating parity automata reduces to checking the emptiness of an equivalent weak automaton, which, in the case of automata over the singleton alphabet, is linear  ... 
arXiv:1903.12620v1 fatcat:slqbuf3vbrduvgitwyrm5euxmm

Büchi Store: An Open Repository of Büchi Automata [chapter]

Yih-Kuen Tsay, Ming-Hsien Tsai, Jinn-Shu Chang, Yi-Wen Chang
2011 Lecture Notes in Computer Science  
We introduce the Büchi Store, an open repository of Büchi automata for model-checking practice, research, and education.  ...  Such a collection of Büchi automata is also useful as a benchmark for evaluating complementation or translation algorithms and as examples for studying Büchi automata and temporal logic.  ...  The automata may be downloaded in the Promela format, for model checking using Spin.  ... 
doi:10.1007/978-3-642-19835-9_23 fatcat:c4iwj7becvbg3nsnztlkfqsq4a

State Space Reductions for Alternating Büchi Automata Quotienting by Simulation Equivalences [chapter]

Carsten Fritz, Thomas Wilke
2002 Lecture Notes in Computer Science  
Quotienting by simulation equivalences is a well-established technique for reducing the size of nondeterministic Büchi automata. We adapt this technique to alternating Büchi automata.  ...  nondeterministic Büchi automata.  ...  is especially easy for weak alternating Büchi automata (Sect. 6).  ... 
doi:10.1007/3-540-36206-1_15 fatcat:ttmuq22k2rhrbgqeoh7kqxt374

Good for Games Automata: From Nondeterminism to Alternation

Udi Boker, Karoliina Lehtinen, Michael Wagner
2019 International Conference on Concurrency Theory  
We then show that alternating GFG automata over finite words, and weak automata over infinite words, are not more succinct than deterministic automata, and that determinizing Büchi and co-Büchi alternating  ...  We leave open the question of whether alternating GFG automata of stronger acceptance conditions allow for doubly-exponential succinctness compared to deterministic automata.  ...  Expressiveness For some acceptance conditions, such as weak, Büchi, and co-Büchi, alternating automata are more expressive than deterministic ones.  ... 
doi:10.4230/lipics.concur.2019.19 dblp:conf/concur/BokerL19 fatcat:w6nqhu5o2zcg3j3jcexgyi4s5y

On Complementing Nondeterministic Büchi Automata [chapter]

Sankar Gurumurthy, Orna Kupferman, Fabio Somenzi, Moshe Y. Vardi
2003 Lecture Notes in Computer Science  
Several optimal algorithms have been proposed for the complementation of nondeterministic Büchi word automata.  ...  Recently, Kupferman and Vardi described a complementation algorithm that goes through weak alternating automata and that seems simpler than previous algorithms.  ...  Doron Bustan called our attention to the improved bound on the rank of a UCW.  ... 
doi:10.1007/978-3-540-39724-3_10 fatcat:3ybtjlyehndelkybkjgn4y6mny

Alternation Elimination for Automata over Nested Words [chapter]

Christian Dax, Felix Klaedtke
2011 Lecture Notes in Computer Science  
This paper presents constructions for translating alternating automata into nondeterministic nested-word automata (NWAs).  ...  The scheme generalizes our alternation-elimination scheme for word automata and the presented complementation constructions generalize existing complementation constructions for word automata.  ...  as abstractions in software model checking, can be carried out in an automata-theoretic setting, similar to finite-state model checking [23] .  ... 
doi:10.1007/978-3-642-19805-2_12 fatcat:ogzkdrnmlneb5nz2jyl33uyoiu

Weak alternating automata are not that weak

Orna Kupferman, Moshe Y. Vardi
2001 ACM Transactions on Computational Logic  
In this paper we describe a quadratic translation, which circumvents the need for determinization, of Büchi and co-Büchi alternating automata to weak alternating automata.  ...  Reasoning about weak alternating automata is easier than reasoning about alternating automata with no restricted structure.  ...  Acknowledgment We thank Nils Klarlund for clarifying the relation between [Kla91] and this work.  ... 
doi:10.1145/377978.377993 fatcat:ksuj4haclngmjgesweqlvbk7sy
« Previous Showing results 1 — 15 out of 1,002 results