A (non-elementary) modular decision procedure for LTrL
Thiagarajan and Walukiewicz  have defined a temporal logic LTrL on Mazurkiewicz traces, patterned on the famous propositional temporal logic of linear time LTL defined by Pnueli. They have shown that this logic is equal in expressive power to the first order theory of finite and infinite traces.
The hopes to get an ”easy” decision procedure for LTrL, as it is the case for LTL, vanished very recently due to a result of Walukiewicz  who showed that the decision procedure for LTrL is non-elementary.
However, tools like Mona  or Mosel  show that it is possible to handle non-elementary logics on significant examples.
Therefore, it appears worthwhile to have a direct decision procedure for LTrL; in this paper we propose such a decision procedure, in a modular way. Since the logic LTrL is not pure future, our algorithm constructs by induction a finite family of Büchi automata for each LTrL-formula. As expected by the results of , the main difficulty comes from the ”Until” operator.
Topicslogic in computer science automata and formal languages theory of parallel and distributed computation model-checking
Unable to display preview. Download preview PDF.
- R. Alur, D. Peled, and W. Penczek. Model-checking of causality properties. In Proceedings of LICS'95, pages 90–100, 1995.Google Scholar
- V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.Google Scholar
- W. Ebinger. Charakterisierung von Sprachklassen unendlicher Spuren durch Logiken. Dissertation, Institut für Informatik, Universität Stuttgart, 1994.Google Scholar
- P. Gastin, R. Meyer, and A. Petit. A (non-elementary) modular decision procedure for LTrL. Technical report, LSV, ENS de Cachan, June 1998.Google Scholar
- P. Kelb, T. Margaria, M. Mendler, and C. Gsottberger. Mosel: a flexible toolset for monadic second-order logic. In Proceedings of CAV'97, LNCS 1254, 1997.Google Scholar
- N. Klarlund. Mona & Fido: The logic-automaton connection in practice. In Proceedings of CSL'97, LNCS, 1998.Google Scholar
- A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.Google Scholar
- D. Perrin and J. E. Pin. Infinite words. Technical report, LITP, Avril 1997.Google Scholar
- A. Pnueli. The temporal logics of programs. In Proceedings of the 18th IEEE FOCS, 1977, pages 46–57, 1977.Google Scholar
- R. Ramanujam. Locally linear time temporal logic. In Proceedings of LICS'96, pages 118–128, 1996.Google Scholar
- S. Safra. On the complexity of Ω-automata. In Proceedings of the 29th annual IEEE Symp. on Foundations of Computer Science, pages 319–327, 1988.Google Scholar
- L. Stockmeyer. The complexity of decision problems in automata theory and logic. PhD thesis, TR 133, M.I.T., Cambridge, 1974.Google Scholar
- P. S. Thiagarajan. A trace based extension of linear time temporal logic. In Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science (LICS'94), pages 438–447, 1994.Google Scholar
- P. S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97), 1997.Google Scholar
- I. Walukiewicz. Difficult configurations — on the complexity of LTrL. In Proceedings of ICALP'98, 1998.Google Scholar