A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Deeper Connections Between LTL and Alternating Automata
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
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. ...
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). ...
Introduction The study of connections between temporal logics and automata proved to be very fruitful. ...
doi:10.1007/11605157_20
fatcat:p2vdeufqc5buhiagqt5vewqfqm
Analyzing LTL Model Checking Techniques for Plan Synthesis and Controller Synthesis (Work in Progress)
2006
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
These alternatives are presented in connection with three different applications of model checking: verification, plan synthesis as well as heuristic guidance of AI planning, and controller synthesis. ...
In this paper, we present alternative means of handling invariances in reachability testing, either by formula progression or compilation into Büchi automata. ...
and the usual connectives ¬ and ∧. ...
doi:10.1016/j.entcs.2005.07.028
fatcat:ddzuwe6sbrbx7mp5x7zcruccbm
On the Power of Automata Minimization in Reactive Synthesis
2021
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In order to reason about LTL f , formulas are typically compiled into deterministic finite automata (DFA), as the intermediate semantic representation. ...
Deeper analysis explains why the supposed advantage of Brzozowski's algorithm does not materialize in practice. ...
WhiteMech (No. 834228), the EU ICT-48 2020 project TAILOR (No. 952215), National Key R&D Program of China (2020AAA0107800), NSF grants IIS-1527668, CCF-1704883, IIS-1830549, DoD MURI grant N00014-20-1-2787, and ...
doi:10.4204/eptcs.346.8
fatcat:65vawwmkczdkda35dzjl43jfnq
Bounded Model Checking of ETL Cooperating with Finite and Looping Automata Connectives
2013
Journal of Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Since such kind of temporal logic involves both finite and looping automata as connectives, all regular properties can be succinctly specified with it. ...
However, the expressiveness of LTL is rather limited, and some important properties cannot be captured by such logic. ...
This work is supported by the NSFC in China under grant number 61103012, 61272335, 61133007, 91118007, 61120106006, the 863 Program 2011AA010106, 2012AA011201, and the Program for New Century Excellent ...
doi:10.1155/2013/462532
fatcat:62o6ezqlgrfinprbrbumysf7zu
Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
algorithm of Bloem et al. for weak automata. ...
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often quite manageable, and ...
We are grateful to Armin Biere and Viktor Schuppan for providing us with their tools in order to test the combination of "liveness to safety" with automata-theoretic approaches. ...
doi:10.1007/11513988_35
fatcat:rrbxufd6frbv5py2lh4aazex6a
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
2010
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
algorithm of Bloem et al. for weak automata. ...
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often quite manageable, and ...
We are grateful to Armin Biere and Viktor Schuppan for providing us with their tools in order to test the combination of "liveness to safety" with automata-theoretic approaches. ...
doi:10.1007/s10009-010-0168-4
fatcat:twspug4b2vhw5jfotp6yt3c35q
A Multi-encoding Approach for LTL Symbolic Satisfiability Checking
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We introduce a novel encoding of symbolic transition-based Büchi automata and a novel, "sloppy," transition encoding, both of which result in improved scalability. ...
Our focus here is on specifications expressed in linear temporal logic (LTL). ...
[3] ) would be an alternative approach, as both BDD-based and SAT-based back ends require symbolic automata. ...
doi:10.1007/978-3-642-21437-0_31
fatcat:43leuwof2vbjnnqs3xjaqtkpxi
Completeness and Complexity of Bounded Model Checking
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe how to compute an over-approximation to CT for a general LTL property using Büchi automata, following the Vardi-Wolper LTL model checking framework. ...
Based on the value of CT , we prove that the complexity of standard SAT-based BMC is doubly exponential, and that consequently there is a complexity gap of an exponent between this procedure and standard ...
LTL model checking with Büchi automata In this section we describe how model checking of LTL formulas can be done with Büchi automata, as it was first introduced by Vardi and Wolper in [15] . ...
doi:10.1007/978-3-540-24622-0_9
fatcat:msh4kjgil5gcves3jyu2osfsvm
On-the-Fly Emptiness Checks for Generalized Büchi Automata
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Emptiness check is a key operation in the automata-theoretic approach to LTL verification. However, it is usually done on Büchi automata with a single acceptance condition. ...
We review existing on-the-fly emptiness-check algorithms for generalized Büchi automata (i.e., with multiple acceptance conditions) and show how they compete favorably with emptiness-checks for degeneralized ...
Verification with
Tarjan's Algorithm
Geldenhuys & Valmari, 2005
Cou99 shy
2004
[19] On Translating LTL
into Alternating and
Nondeterministic Automata
Tauriainen, 2003
Tau03 opt
2005
[ ...
doi:10.1007/11537328_15
fatcat:pn7qgp6nb5f5dfhngqnwvmolzm
Formally Reasoning About Quality
2016
Journal of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We distinguish between two approaches to specifying quality. ...
We demonstrate the usefulness of both extensions and study the decidability and complexity of the decision and search problems for them as well as for extensions of LTL that combine both types of operators ...
We do not distinguish between the two cases, and simply state that the state formula changes to a deeper subformula. ...
doi:10.1145/2875421
fatcat:ni3xosyq2vc6vgupdaijcghzmi
The mu-calculus and Model Checking
[chapter]
2018
Handbook of Model Checking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It gives a quite detailed explanation of the satisfiability algorithm, followed by the results on alternation hierarchy, proof systems, and interpolation. ...
It is a logic with an exceptional balance between expressiveness and algorithmic properties. The chapter describes in length the game characterization of the semantics of the mu-calculus. ...
We translate boolean connectives to the same boolean connectives. For modalities and fixpoints we express semantic clauses from page 4 in MSOL. ...
doi:10.1007/978-3-319-10575-8_26
fatcat:7adhegoggvcjthaa5x5uhfpt24
Computational challenges in bounded model checking
2005
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe how to compute an overapproximation to CT for a general LTL property using Büchi automata, following the Vardi-Wolper LTL model checking framework. ...
Based on the value of CT , we prove that the complexity of standard SAT-based BMC is doubly exponential and that, consequently, there is a complexity gap of an exponent between this procedure and standard ...
We thank Armin Biere for his suggestions to improve this article, and in particular for helping us get right the results on the size of formulas resulting from the syntactic and semantic translations. ...
doi:10.1007/s10009-004-0182-5
fatcat:vj33vvhqjrelpobpvdvloeuimi
One Theorem to Rule Them All
2018
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2018 pre-print arXiv:1805.00748v1 fatcat:27mkwek6rjg5ripomfpzccf7gy
We present a unified translation of LTL formulas into deterministic Rabin automata, limit-deterministic Büchi automata, and nondeterministic Büchi automata. ...
In particular, Safra's, ranking, and breakpoint constructions used in other translations are not needed. ...
" for their helpful comments and remarks. ...
doi:10.1145/3209108.3209161
dblp:conf/lics/EsparzaKS18
fatcat:cue5xgz6jzdorm5pjndmxi3qvm
Linear Encodings of Bounded LTL Model Checking
2006
Logical Methods in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We also extend virtual unrolling to Buchi automata, enabling them to accept minimal length counterexamples. ...
Experiments clearly show that our new encodings improve performance of BMC considerably, particularly in the case of the incremental encoding, and that they are very competitive for finding bugs. ...
This work has been financially supported by the Academy of Finland (projects 109539, 112016, 211025, 213113) and the Emil Aaltonen Foundation. ...
doi:10.2168/lmcs-2(5:5)2006
fatcat:udjtwahnfzft7og3he5s5ntneu
Recent Challenges and Ideas in Temporal Synthesis
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This has to do with theoretical limitations, like the complexity of the problem, algorithmic limitations, like the need to determinize automata on infinite words and solve parity games, methodological ...
reasons, like the lack of satisfactory compositional synthesis algorithms, and practical reasons: current algorithms produce systems that satisfy the specification, but may do so in a peculiar way and ...
Algorithms for solving the synthesis problem are based on automata on infinite words and trees. We assume that the reader is familiar with the basic definitions of alternating tree automata. ...
doi:10.1007/978-3-642-27660-6_8
fatcat:dphuat2tk5ds3bd637h3xibxmq
« Previous
Showing results 1 — 15 out of 274 results