Complete and tractable local linear time temporal logics over traces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 926-937

  Adsul, Bharat ^a   Sohoni, Milind ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

Concurrency; Limits; Mazurkiewicz traces; Temporal logics

Indexed keywords

AUTOMATA THEORY;

BOOLEAN COMBINATIONS; CONCURRENCY; DECISION PROCEDURE; FIRST ORDER LOGIC; FIRST ORDER THEORIES; GLOBAL PROPERTIES; LIMITS; MAZURKIEWICZ TRACES;

TEMPORAL LOGIC;

EID: 84869159405     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_79     Document Type: Conference Paper

References (15)

1. B. Adsul and M. Sohoni: First-Order Logic over Traces, Technical Report, Dept. of Computer Science & Engineering, I. I. T. Mumbai, India (2002). Also see http://www.cse.iitb.ac.in/~abharat/logics.html
2. V. Diekert and P. Gastin: LTL is Expressively Complete for Mazurkiewicz Traces, Proc. ICALP '00, LNCS 1853 (2000) 211-222.
3. V. Diekert and P. Gastin: Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets, Proc. LPAR '01, LNAI 2250 (2000) 55-69.
4. V. Diekert and A. Muscholl: Deterministic Asynchronous Automata for Infinite Traces, Acta Inf., 31 (1993) 379-397.
5. V. Diekert and G. Rozenberg (Eds.): The Book of Traces, World Scientific, Singapore (1995).
6. W. Ebinger and A. Muscholl: Logical Definability on Infinite Traces, Proc. ICALP '93, LNCS 700 (1993) 335-346.
7. O. Maler and A. Pnueli: Tight bounds on the Complexity of Cascaded Decomposition of Automata, Proc. 31st IEEE FOCS '90 (1990) 672-682.
8. Z. Manna and A. Pnueli: The Temporal Logic of Reactive and Concurrent Systems (Specification), Springer-Verlag, Berlin (1991).
9. R. McNaughton and S. Papert: Counter-free Automata, MIT Press, Cambridge (1971).
10. M. Mukund and M. Sohoni: Keeping Track of the Latest Gossip in a Distributed System, Distributed Computing, 10(3) (1997) 137-148.
11. M. Mukund and P.S. Thiagarajan: Linear Time Temporal Logics over Mazurkiewicz Traces, Proc. MFCS'96, LNCS 1113 (1996) 62-92.
12. P.S. Thiagarajan: A Trace Based Extension of Linear Time Temporal Logic, Proc. 9th IEEE LICS (1994) 438-447.
13. W. Thomas: Languages, Automata and Logic, in: Handbook of Formal Languages Vol. 3 - Beyond Words, Springer-Verlag, New York (1997) 389-456.
14. P.S. Thiagarajan and I. Walukiewicz: An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces, Proc. 12th IEEE LICS (1997) 183-194.
15. I.Walukiewicz: Difficult Configurations - On the Complexity of LTrL, Proc. ICALP '98, LNCS 1443 (1998) 140-151.