Benedikt Bollig, Jesper Henriksen, Martin Leucker  Home/Search
Context Related
Links: ACM DBLP | i2.informatik.rwth...enna00_paper.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: i2.informatik.rwthaachen.d...lit (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction A traditional approach towards automatic program veri cation is model checking speci - cations in linear time temporal logic [MP92]. The automata-theoretic approach has proven to be very simple and useful in solving this problem. Ecient (on{the{y) algorithms for checking satis ability of such speci cations are then derived by constructing (e.g. Buchi, Streett or alternating) automata accepting the set of sequences satisfying the formula at hand and checking the corresponding... (Update)
Context of citations to this paper: More
...we only provide a decision procedure for LTML . In order to get an impression how to adapt the procedure to full LTML, see [5]. We will freely use abbreviations = 2 = 3: and so on. To shortly give a feeling in which way our logic may be employed...
.... traces like TrPTL [19] or LTrL [20] to ECMSCs and to employ corresponding decision procedures, for example in the style of [3]. 6 Conclusion In this paper, we presented a formal definition of extended compositional message sequence charts (ECMSCs) with black and...
Cited by: More
On Translating Linear Temporal Logic into Alternating and.. - Tauriainen (2003) (Correct)
Extending Compositional Message Sequence Graphs - Bollig, Leucker, Lucas (2002) (Correct)
Logics for Mazurkiewicz Traces - Leucker (2002) (Correct)
Similar documents (at the sentence level):
11.2%: Deciding LTL over Mazurkiewicz Traces - Bollig, Leucker (2001) (Correct)
8.6%: On Model Checking Synchronised Hardware Circuits - Leucker (2000) (Correct)
Active bibliography (related documents): More All
0.2: An expressively complete temporal logic without past tense.. - Diekert, Gastin (1999) (Correct)
0.2: LTL is expressively complete for Mazurkiewicz - Traces Volker Diekert (2000) (Correct)
0.1: Distributed Versions of Linear Time Temporal Logic: A.. - Thiagarajan, Henriksen (1998) (Correct)
Similar documents based on text: More All
0.9: The Automata-Theoretic Approach Works for Global Trace Logics - Henriksen, Leucker (Correct)
0.4: Model Checking Probabilistic Distributed Systems - Bollig, Leucker (Correct)
0.3: Modelling, Specifying, and Verifying Message Passing Systems - Bollig, Leucker (2001) (Correct)
Related documents from co-citation: More All
4: An expressively complete linear time temporal logic for Mazurkiewicz traces - Thiagarajan, Walukiewicz - 1997
4: and Verifying Message Passing Systems (context) - Bollig, Leucker et al. - 2001
3: International Series in Computer Science (context) - Milner, Concurrency - 1989
BibTeX entry: (Update)
Benedikt Bollig and Martin Leucker. Deciding LTL over Mazurkiewicz Traces. In Proceedings of the Symposium on Temporal Representation and Reasoning (TIME01). IEEE Computer Society Press, 2001. http://citeseer.ist.psu.edu/article/bollig01deciding.html More
@inproceedings{ bollig00deciding,
author = "B. Bollig and J. Henriksen and M. Leucker",
title = "Deciding {LTL} over {M}azurkiewicz Traces",
booktitle = "Theorietag 2000 mit Workshop ``New Computing Paradigms: Molecular Computing and Quantum Computing''",
publisher = "Vienna University of Technology",
editor = "R. Freund",
isbn = "3-85028-325-9",
pages = "167--174",
year = "2000",
url = "citeseer.ist.psu.edu/article/bollig01deciding.html" }
Citations (may not include all citations):1180 The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1992 ACM
603 Kluwer Academic Publishers (context) - McMillan, Checking - 1993
140 Tense Logic and the Theory of Linear Order (context) - Kamp - 1968
128 An Automata-Theoretic Approach to Linear Temporal Logic - Vardi - 1996 ACM DBLP
92 Concurrent program schemes and their interpretations (context) - Mazurkiewicz - 1977
76 MONA: Monadic secondorder logic in practice - Henriksen, Jensen et al. - 1995
55 Automata on innite objects (context) - Thomas - 1990
38 World Scientic (context) - Diekert, Rozenberg et al. - 1995
35 An expressively complete linear time temporal logic for Mazu.. - Thiagarajan, Walukiewicz - 1997 ACM DBLP
27 Ten years of partial order reduction (context) - Peled - 1998 ACM DBLP
10 modular decision procedure for LTrL (context) - Gastin, Meyer et al. - 1998
8 Dicult congurations - on the complexity of LTrL (context) - Walukiewicz - 1998
3 Ltl is expressively complete for mazurkiewicz traces (context) - Diekert, Gastin - 2000 ACM DBLP
The graph only includes citing articles where the year of publication is known.
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