Timo Latvala  Home/Search
Context Related
| tcs.hut.fi/Publicat...HUTTCSA76.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: tcs.hut.fi/Publ...year2002.shtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Safety properties are an interesting subset of general temporal properties for systems. In the linear time paradigm, model checking of safety properties is simpler than the general case, because safety properties can be captured by finite automata. This work discusses the theoretical and some of the practical issues related to model checking LTL properties. (Update)
Cited by: More
Efficient Model Checking of Safety Properties - Latvala (2003) (Correct)
Active bibliography (related documents): More All
1.2: Model Checking LTL Properties of High-Level Petri Nets with.. - Latvala (2001) (Correct)
0.6: Relating Word and Tree Automata - Kupferman, Safra, Vardi (2004) (Correct)
0.5: Model Checking a Path (Preliminary Report) - Markey, Schnoebelen (2003) (Correct)
Similar documents based on text: More All
1.8: Model Checking Linear Temporal Logic Properties Of Petri Nets.. - Latvala (2001) (Correct)
1.1: Deadlock And Reachability Checking With Finite Complete Prefixes - Heljanko (1999) (Correct)
1.0: Implementing LTL Model Checking with Net Unfoldings - Esparza, Heljanko (2001) (Correct)
Related documents from co-citation: More All
2: Formal Aspects of Computing (context) - Sistla, liveness et al. - 1994
2: Fast LTL to Buchi automata translation (context) - Gastin, Oddoux - 2001
2: Simple on-the-fly automatic verification of linear temporal logic - Gerth, Peled et al. - 1995
BibTeX entry: (Update)
Latvala, T.: On model checking safety properties. Technical Report HUT-TCSA76, Helsinki University of Technology (2002) Available from http://www.tcs. hut.fi/Publications. http://citeseer.ist.psu.edu/latvala02model.html More
@misc{ latvala02model,
author = "T. Latvala",
title = "On model checking safety properties",
text = "Latvala, T.: On model checking safety properties. Technical Report HUT-TCSA76,
Helsinki University of Technology (2002) Available from http://www.tcs.
hut.fi/Publications.",
year = "2002",
url = "citeseer.ist.psu.edu/latvala02model.html" }
Citations (may not include all citations):1180 The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1992
828 Model Checking - Clarke, Grumberg et al. - 1999
828 Model checking - Clarke, Schlinglo - 2001
539 The temporal logic of programs (context) - Pnueli - 1977
375 IEEE Transactions on Software Engineering (context) - Holzmann, checker - 1997
254 Book: Assigning Programs to Meanings (context) - Abrail - 1996
244 Symbolic model checking without BDDs - Biere, Cimatti et al. - 1999
222 The complexity of propositional linear temporal logic (context) - Sistla, Clarke - 1985
162 Automata-theoretic techniques for modal logic of programs (context) - Vardi, Wolper - 1986
128 An automata-theoretic approach to linear temporal logic - Vardi - 1996
127 An automata-theoretic approach to branching time model check.. - Bernholtz, Vardi et al. - 1994
85 Coloured Petri Nets (context) - Jensen - 1997
85 Recognizing safety and liveness - Alpern, Schneider - 1987
75 Modalities for model checking: Branching time logic strikes .. (context) - Emerson, Lei - 1987
58 Model checking of safety properties - Kupferman, Vardi - 2001
58 Depth- rst search and linear graph algorithms (context) - Tarjan - 1972
52 Computer-Aided Veri cation of Coordinating Processes: The Au.. (context) - Kurshan - 1994
52 The temporal rover and the ATG rover - Drusinsky - 2000
46 Journal of the Association for Computing Machinery (context) - Chandra, Kozen et al. - 1981
46 Synthesizing monitors for safety properties - Havelund, Rosu - 2002
39 Weak alternating automata are not that weak - Kupferman, Vardi - 1997
37 the temporal logic of programs (context) - Lamport, sometimes et al. - 1980
35 The state explosion problem (context) - Valmari - 1998
34 Speci cation and veri cation of concurrent systems in CESAR (context) - Quielle, Sifakis - 1981
34 Improved automata generation for linear temporal logic - Daniele, Giunchiglia et al. - 1999
34 Automata on in nite objects (context) - Thomas - 1990
34 automatic veri cation of linear temporal logic (context) - Gerth, Peled et al. - 1995
26 linear time: Final showdown (context) - Vardi - 2001
26 Using branching time logic to synthesize synchronization ske.. (context) - Emerson - 1982
25 Fast LTL to B uchi automata translation (context) - Gastin, Oddoux - 2001
24 Alternative semantics for temporal logics (context) - Emerson - 1983
24 Formal Aspects in Computing (context) - Sistla, liveness et al. - 1994
24 A combinatorial approach to the theory (context) - Thomas - 1981
19 uchi automata from LTL formulae (context) - Somenzio, Bloem
19 A new unfolding approach to LTL model checking - Esparza, Heljanko - 2000
18 ModelChecking Techniques and Tools (context) - Berard, Bidoit et al. - 2001
16 Memory ecient algorithms for the veri cation of temporal pro.. (context) - Courcoubetis, Vardi et al. - 1992
14 Reasoning about in nite computations (context) - Vardi, Wolper - 1994
13 Logical foundations (context) - Lamport - 1982
12 Coping with strong fairness - Latvala, Heljanko - 2000
11 the abstraction of coloured Petri nets - Lakos - 1997
11 the construction of monitors for temporal logic properties - Geilen - 2001
10 uchi automata (context) - Etessami, Holzmann - 2000
8 Stepwise introduction and preservation of safety properties .. - Padberg, Ho et al. - 2000
7 Buddy - A binary decision diagram package (context) - rn - 2000
5 A runtime veri - cation tool (context) - Havelund, Rosu - 2001
5 Composing abstractions of coloured Petri nets (context) - Lakos - 2000
5 Testing LTL formula translation into B uchi automata - Tauriainen, Heljanko - 2002
4 Incremental state space construction for coloured petri nets (context) - Lewis, Lakos - 2001
3 Combining Symbolic and Partial Order Methods for Model Check.. - Heljanko - 2002
3 lbt: LTL to B uchi conversion (context) - akel, Tauriainen et al. - 2001
3 veri cation of linear temporal logic (context) - Couvreur - 1999
3 Exploration testing (context) - Helovuo, Lepp - 2001
2 Complexity of Automata on In nite Objects (context) - Safra - 1989
2 Checking nite traces using alternating automata (context) - Finkbeiner, Sipma - 2001
2 Maria: modular reachability analyser for algebraic system ne.. (context) - akel - 2002
2 Design and synthesis of syncronization of skeletons using br.. (context) - Clarke, Emerson - 1981
2 Checking that nite state programs satisfy their linear speci.. (context) - Lichtenstein, Pnueli - 1985
2 uchi automata in polynomial time (context) - Kurshan - 1987
2 Testing linear temporal logic formulae on nite execution tra.. (context) - Havelund, Rosu - 2001
1 Model checking expands veri cation's scope (context) - Goering - 1997
1 Incremental Speci cation and Analysis in the Context of Colo.. (context) - Lewis - 2002
1 Automata-theoretic approach to design veri cation (context) - Vardi - 1999
Documents on the same site (http://www.tcs.hut.fi/Publications/year-2002.shtml): More
Towards Ambitious Approximation Algorithms in Stubborn Set.. - Varpaaniemi (2002) (Correct)
Symmetry Reduction Algorithms For Data Symmetries - Junttila (2002) (Correct)
Bounded Model Checking for Verifying Concurrent Programs - Jussila (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC