Martin Leucker  Home/Search
Context Related
| docs.uu.se/~leucker/Do...200210.pdf.gz aib.informatik.rwthaac...200210.ps.gz www4.in.tum.de/~leucke...200210.pdf.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: i2.informatik.rwthaachen.d...lit (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Linear temporal logic (LTL) has become a well established tool for specifying the dynamic behavior of reactive systems with an interleaving semantics and the automata-theoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to understand decision procedures and directly yield on-the-fly model checking procedures. (Update)
Cited by: More
Efficient Decentralized Monitoring of Safety in.. - Sen, Vardhan, Agha, Rosu (2004) (Correct)
Decentralized Runtime Analysis of Multithreaded Applications - Sen, Vardhan, Agha, Rosu (Correct)
Active bibliography (related documents): More All
1.4: On Model Checking Synchronised Hardware Circuits - Leucker (2000) (Correct)
1.1: Deciding LTL over Mazurkiewicz Traces - Bollig, Leucker (2001) (Correct)
0.7: On Translating Linear Temporal Logic into Alternating and.. - Tauriainen (2003) (Correct)
Similar documents based on text: More All
0.7: High-Level Parallel Programming and the Efficient Implementation.. - Botorog (1998) (Correct)
0.7: Complexity Results and Practical Algorithms for Logics in.. - Tobies (2001) (Correct)
0.6: Improving Statistical Machine Translation using Morpho-syntactic.. - Nießen (2002) (Correct)
Related documents from co-citation: More All
4: A temporal approach to causal knowledge - Penczek - 2000
4: Model-checking of causality properties - Alur, Peled et al. - 1995
4: Local knowledge assertions in a changing world (context) - Ramanujam - 1996
BibTeX entry: (Update)
M. Leucker. Logics for mazurkiewicz traces. Technical Report AIB-2002-10, RWTH, Aachen, Germany, April 2002. http://citeseer.ist.psu.edu/leucker02logics.html More
@techreport{ mazurkiewicz-unknown,
author = "Martin Leucker",
title = "Logics For Mazurkiewicz Traces",
institution = "RWTH",
address = "Aachen, Germany",
number = "AIB-2002-10",
month = "April",
year = "2002",
url = "citeseer.ist.psu.edu/leucker02logics.html" }
Citations (may not include all citations):3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 1990
2157 Design Patterns Elements of Reusable Object-Oriented Softwar.. (context) - Helm, Vlissides - 2000
1180 The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1992
951 Computational Complexity (context) - Papadimitriou - 1994
906 A Structural Approach to Operational Semantics - Plotkin - 1981
539 The temporal logic of programs (context) - Pnueli - 1977
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
407 Introduction to the ISO specification language LOTOS (context) - Bolognesi, Brinksma - 1989
397 Design and Synthesis of Synchronization Skeletons using Bran.. (context) - Clarke, Emerson - 1981
374 Automata on infinite objects (context) - Thomas - 1990
353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
322 volume 92 of Lecture Notes in Computer Science (context) - Milner, for et al. - 1980
227 Formal methods: State of the art and future directions - Clarke, Wing - 1996
222 The complexity of propositional linear temporal logics (context) - Sistla, Clarke - 1982
221 Specification and verification of concurrent systems in CESA.. (context) - Queille, Sifakis - 1982
218 Process algebra for synchronous communication (context) - Bergstra, Klop - 1984
216 Theoretical Computer Science (context) - Milner, synchrony - 1983
207 A stubborn attack on state explosion (context) - Valmari - 1991
206 Results on the propositional mu-calculus (context) - Kozen - 1983
202 International Series in Computer Science (context) - Milner, Concurrency - 1989
176 a decision method in restricted second order arithmetic (context) - Buchi - 1962
140 Tense Logic and the Theory of Linear Order (context) - Kamp - 1968
139 Reasoning about infinite computations - Vardi, Wolper - 1994
128 An Automata-Theoretic Approach to Linear Temporal Logic - Vardi - 1996
127 An automata--theoretic approach to branching--time model che.. - Bernholtz, Vardi et al. - 1994
124 Journal of the ACM (context) - Chandra, Kozen et al. - 1981
119 Using branching time temporal logic to synthesize synchroniz.. (context) - Emerson, Clarke - 1982
112 LUSTRE: A declarative language for programming synchronous s.. (context) - Caspi, Pilaud et al. - 1987
92 Concurrent program schemes and their interpretations (context) - Mazurkiewicz - 1977
86 An automata-theoretic approach to branching-time model check.. - Kupferman, Vardi et al. - 2000
86 Basic notions of trace theory (context) - Mazurkiewicz - 1988
81 The complementation problem for Buchi automata with applicat.. (context) - Sistla, Vardi et al. - 1985
76 Mona: Monadic second-order logic in practice - Henriksen, Jensen et al. - 1995
65 World Scientific (context) - Diekert, Rozenberg et al. - 1995
59 Modalities for model checking: Branching time strikes back (context) - Emerson, Lei - 1985
58 Alternating automata on infinite trees (context) - Muller, Schupp - 1987
55 Concrete process algebra (context) - Baeten, Verhoef - 1994
54 Space-bounded reducibility among combinatorial problems (context) - Jones - 1975
54 Handbook of Process Algebra (context) - Bergstra, Ponse et al. - 2001
49 A basic Petri net programming notation (context) - Best, Hopkins et al. - 1993
47 A trace based extension of linear time temporal logic (context) - Thiagarajan - 1994
42 Theoretical Computer Science (context) - Brzozowski, Leiss et al. - 1980
42 McGraw-Hill (context) - Perry - 1991
39 Weak alternating automata are not that weak - Kupferman, Vardi - 1997
39 Weak alternating automata are not that weak - Kupferman, Vardi - 2001
35 Petri nets and step transition systems - Mukund - 1992
35 An expressively complete linear time temporal logic for Mazu.. - Thiagarajan, Walukiewicz - 1997
33 Handbook of Automated Reasoning (context) - Robinson, Voronkov - 2001
32 On infinite transition graphs having a decidable monadic the.. - Caucal - 1996
31 Partial commutation and traces - Diekert, Metivier - 1997
28 Model checking of causality properties - Alur, Peled et al. - 1995
27 Ten years of partial order reduction (context) - Peled - 1998
26 linear time: Final showdown (context) - Vardi - 2001
25 The Edinburgh Concurrency Workbench (context) - Moller - 1992
24 Industrial-Strength Formal Methods in Practice (context) - Bowen, Hinchey - 1999
22 A trace consistent subset of PTL (context) - Thiagarajan - 1995
21 An algorithmic approach for checking closure properties of #.. - Peled, Wilke et al. - 1996
21 An algorithmic approach for checking closure properties of #.. - Peled, Wilke et al. - 1998
21 Using UML: software engineering with objects and components (context) - Stevens, Pooley - 1998
20 the complexity of omega-automata (context) - Safra - 1988
20 An automata-theoretic approach to reasoning about infinite-s.. - Kupferman, Vardi - 2000
17 Models for concurrency: Towards a classification - Sassone, Nielsen et al. - 1996
17 Informatique Theorique et Applications (context) - Zielonka, finite et al. - 1987
16 Complexity of propositional temporal logics (context) - Sistla, Clarke - 1985
16 Logical definability on infinite traces - Ebinger, Muscholl - 1993
16 Logical definability on infinite traces - Ebinger, Muscholl - 1996
15 Alternating finite automata on #-words (context) - Miyano, Hayashi - 1984
15 Linear time temporal logics over Mazurkiewicz traces (context) - Mukund, Thiagarajan - 1996
14 Problemes combinatoires de commutation et rearrangements (context) - Cartier, Foata - 1969
14 Introduction to Process Algebra (context) - Fokkink - 2000
13 symbolic model checking - an approach (context) - McMillan, system - 1992
11 Weak second order logic and finite automata (context) - Buchi - 1960
11 LISA: A specification language based on WS - Ayari, Basin et al. - 1997
10 Introduction to Formal Hardware Verification (context) - Kropf - 1999
10 modular decision procedure for LTrL (context) - Gastin, Meyer et al. - 1998
10 modular decision procedure for LTrL (context) - Gastin, Meyer et al. - 1998
10 Distributed versions of linear time temporal logic: A trace .. - Thiagarajan, Henriksen - 1998
9 Texts in Computer Science (context) - Stirling, Temporal et al. - 2001
9 Algebraic laws for indeterminism and concurrency (context) - Hennessy, Milner - 1985
8 Communcating Sequential Processes (context) - Hoare - 1985
8 On logical definability of trace languages (context) - Thomas - 1990
7 Alternating automata and the temporal logic of ordinals (context) - Rohde - 1997
7 and verifying message passing systems (context) - Bollig, Leucker et al. - 2001
6 cult configurations - on the complexity of LTrL (context) - Walukiewicz - 1998
6 cult configurations -- on the complexity of LTrL (context) - Walukiewicz
6 American Mathematical Society (context) - Gregoire, Holzmann et al. - 1997
6 ectiveness of logic in computer science (context) - Halpern, Harper et al. - 2001
5 the weak monadic theory of the tree (context) - Muller, Saoudi et al. - 1986
5 Deciding LTL over Mazurkiewicz traces - Bollig, Leucker - 2001
5 Alternating automata and logics over infinite words (context) - Loding, Thomas - 2000
4 Halbleiter-Schaltungstechnik (context) - Tietze, Schenk - 2001
4 Complementation is more di#cult with automata on infinite wo.. (context) - Michel - 1988
4 TruthSLC parallel verification platform concurrent system - Leucker, SLC et al. - 2001
4 Deciding global partial-order properties - Alur, McMillan et al. - 1998
4 User's Manual (context) - editor, TM - 1993
3 LTL is expressively complete for Mazurkiewicz traces (context) - Diekert, Gastin - 2000
3 Star-free regular sets of #-sequences (context) - Thomas - 1979
2 Using asynchronous Buchi automata for e#cient model-checking.. (context) - Peled, Penczek - 1995
2 Complementation of Buchi automata revisited (context) - Thomas - 1999
2 Uber Zerlegungen von Zahlen durch ihre grossten gemeinsamen .. (context) - Dedekind - 1969
2 Technical Report TR (context) - Diekert, Metivier et al. - 1996
2 On Dedekind's problem: the number of monotone Boolean functi.. (context) - Kleitman - 1969
1 Preliminary versions appeared in 6th Annual ACM Symposium on.. (context) - Katz, Peled et al. - 1988
1 Prefix-recognizable graphs and monadic second order logic (context) - Leucker - 2002
1 A methodology for proving control systems with Lustre and PV.. - Bensalem, Caspi et al. - 1999
1 Progress measures for complementation of omegaautomata with .. (context) - Klarlund - 1991
1 Friedrich-AlexanderUniversit at Erlangen Nurnberg (context) - Katoen, Algorithms et al. - 1999
1 Local temporal logic is expressively complete for cograph de.. (context) - Diekert, Gastin - 2001
1 Distributed Systems Analysis (context) - Bruns - 1997
1 On model checking synchronised hardware circuits - Leucker - 2000
1 Digital Systems Design with (context) - Chang - 1999
Documents on the same site (http://www-i2.informatik.rwth-aachen.de/leucker/Literatur/lit.html): More
Implementation of an Efficient Parallel BDD Package - Stornetta (1995) (Correct)
Composing the user interface with Haggis - Finne, Jones (1996) (Correct)
Model Checking and Other Games - Stirling (1996) (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