Petri nets: basic notions, structure, behaviour
Current trends in concurrency. Overviews and tutorials
Behaviour of elementary net systems
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
On the structure of dependence graphs
Concurrency and nets: advances in Petri nets
Theoretical Computer Science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Theoretical Computer Science
An extension of Kleene's and Ochman´ski's theorems to infinite traces
Theoretical Computer Science
Combinatorial properties of dependence graphs
Information and Computation
Logical definability on infinite traces
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
Journal of the ACM (JACM)
The Book of Traces
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
LTL Is Expressively Complete for Mazurkiewicz Traces
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Characterization of Temporal Property Classes
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
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
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
| Hi-index | 0.00 |
For infinite words there are well-known characterizations of safety and liveness properties. We extend these results to real Mazurkiewicz traces. This is possible due to a result, which has been established recently: Every first-order definable real trace language is definable in linear temporal logic using future tense operators, only. We show that the canonical choice for a topological characterization of safety and liveness properties is given by the Scott topology. In this paper we use an algebraic approach where we work with aperiodic monoids. Therefore we also give a direct translation from temporal logic to aperiodic monoids which is of independent interest.