Complete and Tractable Local Linear Time Temporal Logics over Traces-Reference-Cited by-同舟云学术

Complete and Tractable Local Linear Time Temporal Logics over Traces

Published:2002 Issue: Volume: Page:926-937
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Adsul Bharat,Sohoni Milind

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45465-9_79

Reference15 articles.

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. Lect Notes Comput Sci;V. Diekert,2000

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).

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces;Lecture Notes in Computer Science;2005

2. Local temporal logic is expressively complete for cograph dependence alphabets;Information and Computation;2004-11

3. Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces;LATIN 2004: Theoretical Informatics;2004

4. Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces;Mathematical Foundations of Computer Science 2003;2003

5. Local Normal Forms for Logics over Traces;FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science;2002