Handbook of theoretical computer science (vol. B)
The Book of Traces
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
Complete and Tractable Local Linear Time Temporal Logics over Traces
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Logical Definability on Infinite Traces
ICALP '93 Proceedings of the 20th 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
Keeping track of the latest gossip in a distributed system
Distributed Computing
| Hi-index | 0.03 |
We investigate local and global paradigms of reasoning about distributed behaviours, modelled as Mazurkiewicz traces, in the context of first-order and monadic second-order logics. We describe new normal forms for properties expressible in these logics. The first normal form, surprisingly, yields a decomposition of a global property as a boolean combination of local properties. The second normal form strengthens McNaughton's theorem and states that global properties of infinite behaviours may also be described as boolean combinations of recurring properties of finite local histories of the behaviours. We briefly touch upon some of the interesting applications of these normal forms.