A long standing open problem in the theory of (Mazurkiewicz) traces has been the question whether LTL (linear temporal logic) is expressively complete with respect to the first order theory. We solve this problem positively for finite and infinite traces and for the simplest temporal logic, which is
Time-stamps for Mazurkiewicz traces
✍ Scribed by Wiesław Zielonka
- Book ID
- 108281169
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 191 KB
- Volume
- 356
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Linear temporal logic (LTL) has become a well established tool for specifying the dynamic behaviour of reactive systems with an interleaving semantics, and the automata-theoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alter
The present paper characterizes the topological structure of real traces. This is done in terms of graph-theoretic properties of the underlying (possibly inÿnite) dependence alphabet. The topological space of real traces is shown to be homeomorphic to the direct product of (at most) the full binary