Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
A star-height problem in free monoids with partial commutations
14th International Colloquium on Automata, languages and programming
Theoretical Computer Science
On the starheight of some rational subsets closed under partial commutations
Information and Computation
Logical definability on infinite traces
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Determinants and Möbius functions in trace monoids
Discrete Mathematics
Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
Journal of the ACM (JACM)
LTL is expressively complete for Mazurkiewicz traces
Journal of Computer and System Sciences
A v-Calculus with Local Views for Systems of Sequential Agents
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Linear Time Temporal Logics over Mazurkiewicz Traces
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Difficult Configurations - On the Complexity of LTrL
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Trace Consistent Subset of PTL
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Safety and liveness properties for real traces and a direct translation from LTL to monoids
Formal and natural computing
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Model-Checking of causality properties
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Locally linear time temporal logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
An Exprssively Complete Linear Time Temporal Logic for Mazurkiewicz Traces.
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Information and Computation
Modal logic over higher dimensional automata
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On Three Alternative Characterizations of Combined Traces
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Verification of petri nets with read arcs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
We review some results on global and local temporal logic on Mazurkiewicz traces. Our main contribution is to show how to derive the expressive completeness of global temporal logic with respect to first-order logic [V. Diekert, P. Gastin, LTL is expressively complete for Mazurkiewicz traces, J. Comput. System Sci. 64 (2002) 396-418] from the similar result on local temporal logic [V. Diekert, P. Gastin, Pure future local temporal logics are expressively complete for Mazurkiewicz traces, in: M. Farach-Colton (Ed.), Proc. LATIN'04, Lecture Notes in Computer Science, Vol. 2976, Springer, Berlin, 2004, pp. 232-241, Full version available as Research Report LSV-05-22, Laboratoire Spécification et Vérification, ENS Cachan, France].