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.
Filters
An automata-theoretic approach to branching-time model checking (Extended abstract)
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification ...
On the other hand, for branching temporal logic, automata-theoretic techniques have long been thought to inlroduce an exponential penalty, making them essentially useless for model-checking. ...
Alternating Automata and Model Checking In this section we introduce an automata-theoretic approach to model checking for branching temporal logic. ...
doi:10.1007/3-540-58179-0_50
fatcat:uwvhl43uvjht3ok7epblznjduy
Page 1918 of Mathematical Reviews Vol. , Issue 97C
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We demonstrate our framework with the branching-time tempo- ral logic CTL and show that it yields a linear automata-based model-checking algorithm, matching the known bound. ...
On the other hand, for branching-time temporal logics, current automata- theoretic techniques involve an exponential blow-up, making them essentially useless for model-checking. ...
Page 3877 of Mathematical Reviews Vol. , Issue 98F
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We describe automata-theoretic methods for solving the satisfiability and model checking problems for these logics. ...
When bounds on the number of equivalence classes are obtained, bounds on the running times of model checking and synthesis algorithms follow as corollaries. ...
Page 5269 of Mathematical Reviews Vol. , Issue 98H
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In the framework of temporal logics over discrete linear models, this problem arises when properties of bounded time intervals are to be described: In the propositional temporal logic PTL, such properties ...
A central issue in the use of temporal logics for the specification and verification of programs is the balance between expressiveness and complexity of decision procedures (for model checking or for satisfiability ...
Page 7280 of Mathematical Reviews Vol. , Issue 2004i
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The use of the stable model semantics leads to compact encod- ings of bounded reachability and deadlock detection tasks as well as the more general problem of bounded model checking of linear temporal ...
Summary: “We settle the complexity bounds of the model check- ing problem for the ambient calculus with public names against the ambient logic. ...
Page 9203 of Mathematical Reviews Vol. , Issue 2004k
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
and model checking for checking secure
information flow in concurrent systems. ...
| (CZ-MASC; Brno);
Moller, Faron (4-WALS-C; Swansea) ;
Sawa, Zdenék (CZ-TUOEE-C; Ostrava)
DP lower bounds for equivalence-checking and modei-checking of one-counter automata. ...
Page 2065 of Mathematical Reviews Vol. , Issue 2003C
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Then we develop a new temporal logic based on reversal-bounded counter machines that can be used to describe properties of BPA(Z) and show that the model-checking problem is decidable.” ...
Early extensions of linear temporal logic with automata use nondeterministic Biichi automata. ...
Page 6286 of Mathematical Reviews Vol. , Issue 2003h
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In the linear framework, we show that when clopen specifications are given by word automata or temporal logic formulas, we can identify a bound and translate the specification to bounded formalisms such ...
by tree automata or temporal logic formulas, even for trees with infinite branching degrees. ...
Towards a Theory of Time-Bounded Verification
[chapter]
2010
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 propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. ...
We argue that this theory is both pertinent, in that it is fully adequate to handle a large proportion of 'real-world' real-time systems and specifications; and effective, in that the restriction to bounded ...
Finally, we devoted a significant fraction of our efforts to time-bounded model-checking and satisfiability questions for timed automata and metric logics. ...
doi:10.1007/978-3-642-14162-1_3
fatcat:q7iqoq6gmnhwtia4qsuiw5lame
Branching-Time Temporal Logic and Tree Automata
1996
Information and Computation
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.
Acknowledgment We thank Moshe Vardi for many helpful suggestions and discussions. ...
Note that when linear-time temporal logic is considered, these problems do not exist. There, automata on words handle all models and the lower bounds of satis ability and model checking coincide. ...
We demonstrate our framework with the branching-time temporal logic CTL and show that it yields a linear automata-based model-checking algorithm, matching the known bound. ...
doi:10.1006/inco.1996.0021
fatcat:bxhwnqznjjb6nkbczx6hs3p744
From Philosophical to Industrial Logics
[chapter]
2008
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 2019; you can also visit the original URL.
The file type is application/pdf.
for model-checking tools. ...
This development was enabled by the equally unlikely transformation of the mathematical machinery of automata on infinite words, introduced in the early 1960s for second-order logic, into effective algorithms ...
Rozier, and D. Tabakov for proofreading earlier drafts. I'd also like to thank K. Rozier for her help with graphics. ...
doi:10.1007/978-3-540-92701-3_7
fatcat:jmuizalywnhflmx46d65gsxita
Extended Computation Tree Logic
[chapter]
2010
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.
Other Versions
We show that even with context-free languages on the until operator the logic still allows for polynomial time model-checking despite the significant increase in expressive power. ...
We consider several classes of languages leading to logics with different expressive power and complexity, whose importance is motivated by their use in model checking, synthesis, abstract interpretation ...
and model checking as well as the expressive power and model-theoretic properties of the resulting logics in accordance to the classes of languages. ...
doi:10.1007/978-3-642-16242-8_6
fatcat:4pvdbae6fbdkpmtiha4mnlrzyy
Robust Satisfaction
[chapter]
1999
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 2019; you can also visit the original URL.
The file type is application/pdf.
We consider systems modeled by nondeterministic Moore machines, and properties specified by branching temporal logic (for linear temporal logic, robust satisfaction coincides with usual satisfaction). ...
The problem of robust model checking is then to decide, given M and , whether M robustly satisfies . In this paper we study the robust-model-checking problem. ...
Transformation of the game-theoretic approach to model checking and adjustment of verification methods to the open-system setting started, for linear temporal logic, with the problem of receptiveness ...
doi:10.1007/3-540-48320-9_27
fatcat:n37pabvq6nfslby4edkeiioxkq
Model-checking Timed Temporal Logics
2009
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 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present several timed extensions of temporal logics, that can be used for model-checking real-time systems. ...
We give different formalisms and the corresponding decidability/complexity results. We also give intuition to explain these results. ...
Acknowledgement I want to thank all the persons I have recently worked with on timed temporal logics, Fabrice Chevalier, Nicolas Markey, Joël Ouaknine, and James Worrell. ...
doi:10.1016/j.entcs.2009.02.044
fatcat:fs37wrodozgfdj6kvxu7d27gnm
Model Checking as A Reachability Problem
[chapter]
2009
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.
• Which is better: Büchi automata or generalized Büchi automata? It is automata generation vs. model checking. • LTL is weak, theoretically and practically! ...
liveness
Temporal Logic Linear Temporal logic (LTL): logic of temporal sequences (Pnueli'77) Main feature: time is implicit • next φ: φ holds in the next state. • eventually φ: φ holds eventually • always ...
doi:10.1007/978-3-642-04420-5_5
fatcat:fxd6kr3oazbibm7vc3vqfumtpi
« Previous
Showing results 1 — 15 out of 5,162 results