Difficult configurations-on the complexity of LTrL

Formal Methods in System Design

Volumn 26, Issue 1, 2005, Pages 27-43

  Walukiewicz, Igor ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Temporal logics; Trace theory; Verification

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; EVALUATION; PROBLEM SOLVING; SORTING; THEOREM PROVING;

GLOBAL STATE; TEMPORAL LOGICS; TRACE THEORY; VERIFICATION;

FORMAL LOGIC;

EID: 17444377557     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-005-4593-z     Document Type: Article

References (18)

1. R. Alur, K. McMillan, and D. Peled, "Deciding global partial-order properties," in IGALP'98, 1998, pp. 41-52.
2. R. Alur, D. Peled, and W. Penczek, "Model-checking of causality properties," in LIGS '95, 1995, pp. 90-100.
3. V. Diekert and P. Gastin, "LTL is expressively complete for Mazurkiewicz traces," in ICALP'OO, Vol. 1853 of LNCS, 2000, pp. 211-222.
4. V. Diekert and G. Rozenberg (Eds.), The Book of Traces, World Scientific, 1995.
5. W. Ebinger and A. Muscholl, "Logical definability on infinite traces," in ICALP '93, Vol. 700, 1993, pp. 335-346.
6. P. Godefroid, Partial-Order Methods for the Verification of Concurrent Systems, Vol. 1032 of LNCS. Springer-Verlag, 1996.
7. K. Lodaya, R. Parikh, R. Ramanujam, and P. S. Thiagarajan, "A logical study of distributed transition systems," Information and Computation, Vol. 119, No. 1, pp. 91-118, 1995.
8. P. Niebert, "A temporal logic for the specification and verification of distributed behaviour," Ph.D. thesis, Universität Hildesheim, 1998 . Also available as Informatik-Bericht Nr. 99-02, Institut für Software, Abteilung Programmierung, Technische Universität Braunschweig, Gaußtraße 11, D-38092 Braunschweig/Germany.
9. P. Niebert, "A temporal logic for the specification and verification of distributed behaviour," Ph.D. thesis, Universität Hildesheim, 1998 . Also available as Informatik-Bericht Nr. 99-02, Institut für Software, Abteilung Programmierung, Technische Universität Braunschweig, Gaußtraße 11, D-38092 Braunschweig/Germany.
10. D. Peled, "Partial order reduction: Model checking using representatives," in MFCS'96, Vol. 1113 of LNCS, 1996, pp. 93-112.
11. D. Peled and A. Pnueli, "Proving partial order properties," Theoretical Computer Science, Vol. 126, pp. 143-182, 1994.
12. W. Penczek, "On udecidability of prepositional temporal logics on trace systems," Information Processing Letters, Vol. 43, pp. 147-153, 1992.
13. R. Ramanujam, "Locally linear time temporal logic," in LICS '96, 1996, pp. 118-128.
14. A. Sistla and E. Clarke, "The complexity of prepositional linear time logic," J. ACM, Vol. 32, pp. 733-749, 1985.
15. P.S. Thiagarajan, "A trace based extension of linear time temporal logic," in LICS., 1994, pp. 438-447.
16. P.S. Thiagarajan and I. Walukiewicz, "An expressively complete linear time temporal logic for Mazurkiewicz traces," in LICS'97, 1997, pp. 183-194.
17. A. Valmari, "A stubborn attack on state explosion," Formal Methods in System Design, Vol. 1, pp. 297-322, 1992.
18. I. Walukiewicz, "Local logics for traces," Technical Report RS-00-2, BRIGS, Aarhus University. Extended version to appear in Journal of Automata, Languages and Combinatorics, 2000.