V. Diekert and P. Gastin. LTL is expressively complete for Mazurkiewicz traces. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000), volume 1853 of Lecture Notes in Computer Science, pages 211--222. Springer, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Logics for Mazurkiewicz Traces - Leucker (2002) (4 citations) (Correct)
....(without past tense modalities) is expressively equivalent to FO i# the independence adheres to a certain structure [DG01] This lead Thiagarajan and Walukiewicz to define the configuration based LTrL [TW97] that they indeed prove equivalent to FO. LTrL was later refined by Diekert and Gastin [DG00] to a straightforward formulation of LTL for traces essentially extending Kamp s Theorem [Kam68] to the setting of traces. While both the event based and location based logics all have elegant (exponential time) decision procedures smoothly extending the classical automata theoretic approach to ....
....first order logic over traces. LTL t strictly speaking a syntactically slightly richer version thereof was introduced by Thiagarajan and Walukiewicz [TW97] and they proved that it is expressively equivalent to first order logic over Mazurkiewicz traces. Later, Diekert and Gastin showed in [DG00] that even without the restricted past modality employed in [TW97] this logic is expressively complete with respect to first order logic over traces. Consequently, we consider their LTL version. In the first section of this chapter, we introduce LTL t by means of its syntax and its semantics. We ....
[Article contains additional citation context not shown here]
V. Diekert and P. Gastin. LTL is expressively complete for Mazurkiewicz traces. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000), volume 1853 of Lecture Notes in Computer Science, pages 211--222. Springer, 2000.
Deciding LTL over Mazurkiewicz Traces - Bollig, Leucker (2001) (1 citation) (Correct)
....property and hence are amenable to partial order veri cation. However, none of the local logics are known to be expressively equivalent to FO. This lead Thiagarajan and Walukiewicz to de ne the con guration based LTrL [TW97] which they indeed prove equivalent to FO. LTrL was later re ned [DG00] to a straightforward formulation of LTL for traces essentially extending Kamp s Theorem [Kam68] to the setting of traces. While both the event based and location based logics all have elegant (exponential time) decision procedures smoothly extending the classical automatatheoretic approach to ....
....and semantics of the linear time temporal logic LTL, which will be our basic object of study. It was originally introduced for strings by Pnueli [Pnu77] It was later equipped with a trace semantics [TW97] and proved expressively equivalent to rst order logic for traces by Diekert and Gastin [DG00], and this is the version we will consider here. The formulas of LTL are parameterised by a trace alphabet ( I) and are de ned inductively as follows: LTL( I) tt j : j j hai j U ; a 2 : 8 Formulas of LTL( I) are interpreted over con gurations of traces over ( I) More ....
[Article contains additional citation context not shown here]
Volker Diekert and Paul Gastin. LTL is expressively complete for mazurkiewicz traces. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000), volume 1853 of LNCS, Springer-Verlag, 2000.
Deciding LTL over Mazurkiewicz Traces - Bollig, Henriksen, Leucker (2001) (1 citation) (Correct)
....of an automaton accepting all linearisations of the partial orders satisfying the speci cation, well understood partial order reduction techniques can be employed and will yield considerable results. Recently, a linear time temporal logic (LTL) over traces was introduced by Diekert and Gastin [DG00] and shown to be expressive complete wrt. rst order logic (FO) over traces. Recalling Kamp s [Kam68] important result that LTL over words is expressive complete wrt. FO over words, we learn that LTL (over traces) covers exactly those speci cations expressible in LTL (over words) which are trace ....
Volker Diekert and Paul Gastin. Ltl is expressively complete for mazurkiewicz traces. In Proceedings of 27th International Colloquium on Automata, Languages and Programming ICALP'2000, volume 1853 of LNCS, Springer-Verlag, 2000.
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