A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Filters
Bounded Model Checking for Region Automata
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
Bounded Model Checking for Region Automata. Fang Yu, Bow-Yaw Wang and Yaw-Wen Huang. ...
Checking
Formal Methods
Real-Time Systems
Program Security
Software Tools Development
Toward Unbounded Model Checking for Region Automata. ...
doi:10.1007/978-3-540-30206-3_18
fatcat:g5sawav6rvbtfntyihfbjtp3re
Robust Model-Checking of Linear-Time Properties in Timed Automata
[chapter]
2006
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.
It is thus a problem of robust model-checking. ...
We also develop a PSPACE algorithm for verifying simple timed properties (namely, the bounded-response-time and bounded-invariance properties). ...
In the next sections, we solve the robust model-checking for co-Büchi, LTL, and bounded-response-time properties. ...
doi:10.1007/11682462_25
fatcat:4qgq5hpsprfb3gkxp6r3ciw2om
Product Interval Automata: A Subclass of Timed Automata
[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.
Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of real-time systems whose correctness depends on relative magnitudes of di erent ...
Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see 23] for a survey). ...
Many thanks to them, and to Salvatore La Torre for comments on this survey. ...
doi:10.1007/3-540-46691-6_5
fatcat:drc3suuptfgzbi7cwjkxey5fo4
Timed Automata
[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.
Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of real-time systems whose correctness depends on relative magnitudes of different ...
Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). ...
Many thanks to them, and to Salvatore La Torre for comments on this survey. ...
doi:10.1007/3-540-48683-6_3
fatcat:krziony2hzgj5ploa37xa5jfcy
Model Checking Real-Time Systems
[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.
This chapter surveys timed automata as a formalism for model checking real-time systems. ...
We begin with introducing the model, as an extension of finite-state automata with real-valued variables for measuring time. ...
Acknowledgement We thank the reviewers for their numerous comments, remarks and additional references, which greatly helped us improve this chapter. ...
doi:10.1007/978-3-319-10575-8_29
fatcat:thsp3udcpnfyjpjzn6i2slbplm
Property Driven Three-Valued Model Checking on Hybrid Automata
[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 2019; you can also visit the original URL.
The file type is application/pdf.
The technique of multivalued model checking for hybrid automata aims at combining the advantages of classical methods based either on the preorder of simulation or on bounded reachability. ...
In this paper, we present a three-valued property driven model checking algorithm for the logic CTL on hybrid automata. ...
On this ground, we extend the applicability of three-valued model checking on classes of HA having infinite DBBs. ...
doi:10.1007/978-3-642-02261-6_18
fatcat:mutzrkfhxfbmffbnp3d7g6tt7y
Robust Model-Checking of Timed Automata via Pumping in Channel Machines
[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 2016; you can also visit the original URL.
The file type is application/pdf.
In this work, we show that robust model-checking against -regular properties for timed automata can be reduced to standard model-checking of timed automata, by computing an adequate bound on the imprecision ...
This yields a new algorithm for robust model-checking of -regular properties, which is both optimal and valid for general timed automata. ...
Our algorithm consists in reducing the problem to classical model-checking of timed automata and is valid for general timed automata: we do not assume progress cycles, nor any upper bound on the clocks ...
doi:10.1007/978-3-642-24310-3_8
fatcat:5lin7rai4fhbngs2i5jzgigygq
Timed Temporal Logics
[chapter]
2017
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.
The main ingredient for model checking CTL, which already gives its lower-bound, is the original algorithm for reachability in timed automata: Theorem 1 ([6] ). ...
CTL model checking is PSPACE-complete over timed automata. Remark 1. ...
doi:10.1007/978-3-319-63121-9_11
fatcat:nytl6mhwojf5jeuzdkec2igwf4
Decision Problems for Lower/Upper Bound Parametric Timed Automata
[chapter]
2007
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.
For such automata, we show that checking if for a parameter valuation (resp., all parameter valuations) there is an infinite accepting run is PSPACE-complete. ...
Finally, we consider a parametric extension of MITL0,∞, and prove that the related satisfiability and model checking (w.r.t. L/U automata) problems are PSPACE-complete. ...
Finally, we use L/U automata to decide satisfiability and model-checking related problems for a dense-time linear temporal logic. Upper bound automata. ...
doi:10.1007/978-3-540-73420-8_79
fatcat:qfzxsku6o5h77irx5a5tcma67q
Decision problems for lower/upper bound parametric timed automata
2009
Formal methods in system design
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.
For such automata, we show that checking if for a parameter valuation (resp., all parameter valuations) there is an infinite accepting run is PSPACE-complete. ...
Finally, we consider a parametric extension of MITL0,∞, and prove that the related satisfiability and model checking (w.r.t. L/U automata) problems are PSPACE-complete. ...
Finally, we use L/U automata to decide satisfiability and model-checking related problems for a dense-time linear temporal logic. Upper bound automata. ...
doi:10.1007/s10703-009-0074-0
fatcat:n7l4h43whrf2zovj35vem5pgqa
Quantitative analysis of real-time systems using priced timed automata
2011
Communications 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 2015; you can also visit the original URL.
The file type is application/pdf.
MPSoC). 22 Just as symbolic reachability checking of finite-state models has lead to very efficient planning and scheduling algorithms, reachability checking for (priced) timed automata has demonstrated ...
TIMED AUTOMATA
A model for time Timed automata 5 are a powerful model for representing and reasoning about systems where the notion of time is essential. ...
doi:10.1145/1995376.1995396
fatcat:omrd5utiebfczd7h3oy6tu6vxu
Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata
[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 2015; you can also visit the original URL.
The file type is application/pdf.
Timed automata (TAs) are a common formalism for modeling timed systems. Bounded model checking (BMC) is a verification method that searches for runs violating a property using a SAT or SMT solver. ...
.): FMOODS/FORTE 2012, LNCS 7273, pp. 84-100, 2012. c IFIP International Federation for Information Processing 2012 Beyond Lassos: Complete SMT-Based Bounded Model Checking for TAs 85 applied to timed ...
Conclusions In this paper, we have shown that traditional lasso-based SMT BMC is not complete for model checking linear-time properties on timed automata, introduced region-based SMT BMC to fix this problem ...
doi:10.1007/978-3-642-30793-5_6
fatcat:rmvijqh2e5fdrlw4jlfwz6icxy
Unbounded, Fully Symbolic Model Checking of Timed Automata Using Boolean Methods
[chapter]
2003
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 present a new approach to unbounded, fully symbolic model checking of timed automata that is based on an efficient translation of quantified separation logic to quantified Boolean logic. ...
We present preliminary empirical results for a BDD-based implementation of our method. ...
We thank Joël Ouaknine, Ofer Strichman, and the reviewers for useful comments. We also thank the authors of DDD and Red for providing their tools and answering our queries. ...
doi:10.1007/978-3-540-45069-6_16
fatcat:3jrtckujoje2tcafinedoeqqeq
A classification of symbolic transition systems
2005
ACM Transactions on Computational Logic
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.
Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining ...
Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington Headquarters Services, Directorate for ...
Model checking Corollary 1B The L 1 model-checking problem is decidable for the class STS1 of symbolic transition systems. ...
doi:10.1145/1042038.1042039
fatcat:dblsc35eyfc57lny2n652zat4y
A Classification of Symbolic Transition Systems
[chapter]
2000
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.
Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining ...
Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington Headquarters Services, Directorate for ...
Model checking Corollary 1B The L 1 model-checking problem is decidable for the class STS1 of symbolic transition systems. ...
doi:10.1007/3-540-46541-3_2
fatcat:pj2pwbwrlffxlkxkoa2bnplgqy
« Previous
Showing results 1 — 15 out of 9,158 results