Pure future local temporal logics are expressively complete for Mazurkiewicz traces

12Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper settles a long standing problem for Mazurkiewicz traces: the pure future local temporal logic defined with the basic modalities exists-next and until is expressively complete. The analogous result with a global interpretation was solved some years ago by Thiagarajan and Walukiewicz (1997) and in its final form without any reference to past tense constants by Diekert and Gastin (2000). Each, the (previously known) global or the (new) local result generalizes Kamp's Theorem for words, because for sequences local and global viewpoints coincide. But traces are labelled partial orders and then the difference between an interpretation globally over cuts (configurations) or locally at points (events) is significant. For global temporal logics the satisfiability problem is non-elementary (Walukiewicz 1998), whereas for local temporal logics both the satisfiability problem and the model checking problem are solvable in PSPACE (Gastin and Kuske 2003) as in the case of words. This makes local temporal logics much more attractive. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Diekert, V., & Gastin, P. (2004). Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2976, 232–241. https://doi.org/10.1007/978-3-540-24698-5_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free