LTL is expressively complete for Mazurkiewicz traces
Journal of Computer and System Sciences
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
LTL Is Expressively Complete for Mazurkiewicz Traces
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Action Refinement from a Logical Point of View
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Safety and liveness properties for real traces and a direct translation from LTL to monoids
Formal and natural computing
An expressively complete linear time temporal logic for Mazurkiewicz traces
Information and Computation - Special issue: LICS'97
Locally linear time temporal logic
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
From local to global temporal logics over Mazurkiewicz traces
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Pure future local temporal logics are expressively complete for Mazurkiewicz traces
Information and Computation
Local temporal logic is expressively complete for cograph dependence alphabets
Information and Computation
On hierarchically developing reactive systems
Information and Computation
| Hi-index | 0.00 |