traces Volker Diekert and Paul Gastin Inst. fur Informatik, Universitat...  Home/Search
Context
Related
| inf.informatik.uni...Gastin2000icalp.ps 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: informatik.unistut...veroeff.sh? (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A long standing open problem in the theory of (Mazurkiewicz) traces has been the question whether LTL (Linear Time Logic) is expressively complete with respect to the rst order theory. We solve this problem positively for nite and in nite traces and for the simplest temporal logic, which is based only on next and until modalities. Similar results were established previously, but they were all weaker, since they used additional past or future modalities. Another feature of our work is... (Update)
Similar documents (at the sentence level):
10.5%: An expressively complete temporal logic without past tense.. - Diekert, Gastin (1999) (Correct)
Active bibliography (related documents): More All
0.9: An Expressive Extension of TLC - Henriksen (1999) (Correct)
0.8: Distributed Versions of Linear Time Temporal Logic: A.. - Thiagarajan, Henriksen (1998) (Correct)
0.5: An Expressively Complete Linear Time Temporal Logic for.. - Spic (1997) (Correct)
Similar documents based on text: More All
0.5: Proceedings ASMICS Workshop Infinite Traces - Diekert, al. (1992) (Correct)
0.5: Characterization of the Expressive Power of Silent.. - Bérard, Diekert.. (1998) (Correct)
0.5: A Domain for Concurrent Termination: A Generalization of.. - Diekert, Gastin (1994) (Correct)
BibTeX entry: (Update)
@misc{ diekert-ltl,
author = "Traces Volker Diekert",
title = "LTL is expressively complete for Mazurkiewicz",
url = "citeseer.ist.psu.edu/608636.html" }
Citations (may not include all citations):163 the temporal analysis of fairness (context) - Gabbay, Pnueli et al. - 1980
140 Tense Logic and the Theory of Linear Order (context) - Kamp - 1968
47 A trace based extension of linear time temporal logic (context) - Thiagarajan - 1994
38 World Scienti c (context) - Diekert, Rozenberg et al. - 1995
35 An expressively complete linear time temporal logic for Mazu.. - Thiagarajan, Walukiewicz - 1997
28 Model-checking of causality properties - Alur, Peled et al. - 1995
25 Locally linear time temporal logic - Ramanujam - 1996
22 A trace consistent subset of PTL (context) - Thiagarajan - 1995
16 Classifying discrete temporal properties - Wilke - 1999
15 Linear time temporal logics over Mazurkiewicz traces (context) - Mukund, Thiagarajan - 1996
11 Charakterisierung von Sprachklassen unendlicher Spuren durch.. (context) - Ebinger - 1994
10 Traces and logic (context) - Penczek, Kuiper - 1995
10 modular decision procedure for ltrl (context) - Gastin, Meyer et al. - 1998
8 calculus with local views for sequential agents (context) - Niebert - 1995
8 Dicult con gurations { on the complexity of LTrL (context) - Walukiewicz - 1998
5 An expressively complete temporal logic without past tense o.. - Diekert, Gastin - 1999
3 Expressive completeness of LTrL on nite traces: an algebraic.. (context) - Meyer, Petit - 1998
2 Temporal logics for trace systems: On automated veri cation (context) - Penczek - 1993
2 Theoretical Computer Science (context) - Ebinger, Muscholl et al. - 1996
Documents on the same site (http://www.informatik.uni-stuttgart.de/tibin/veroeff.sh?): More
Matching Specifications for Message Sequence Charts - Muscholl (1999) (Correct)
Trace Rewriting: Computing normal forms in time O(n log n) - Bertol, Diekert (1996) (Correct)
Deterministic Asynchronous Automata for Infinite Traces - Diekert, Muscholl (1993) (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