LTL Is Expressively Complete for Mazurkiewicz Traces

作者:

Highlights:

摘要

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 posi- tively for finite and infinite traces and for the simplest temporal logic, which is based only on next and until modalities. Similar results were established previously, but they were all weaker, since they used additional past or future modalities. Another feature of our work is that our proof is direct and does not use any reduction to the word case.

论文关键词:temporal logic,Mazurkiewicz traces,concurrency

论文评审过程:Received 6 February 2001, Revised 14 December 2001, Available online 25 May 2002.

论文官网地址:https://doi.org/10.1006/jcss.2001.1817