Deciding LTL over Mazurkiewicz traces
Data & Knowledge Engineering - Special issue: Temporal representation and reasoning
LTL is expressively complete for Mazurkiewicz traces
Journal of Computer and System Sciences
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
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]
An Expressive Extension of TLC
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Complete and Tractable Local Linear Time Temporal Logics over Traces
ICALP '02 Proceedings of the 29th 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
Safe Realizability of High-Level Message Sequence Charts
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Local Normal Forms for Logics over Traces
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
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
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
An expressively complete linear time temporal logic for Mazurkiewicz traces
Information and Computation - Special issue: LICS'97
Realizability of high-level message sequence charts: closing the gaps
Theoretical 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
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Tree Pattern Rewriting Systems
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Efficient model checking for LTL with partial order snapshots
Theoretical Computer Science
Truly Concurrent Logic via In-Between Specification
Electronic Notes in Theoretical Computer Science (ENTCS)
Local temporal logic is expressively complete for cograph dependence alphabets
Information and Computation
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An NP-Complete fragment of LTL
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Efficient model checking for LTL with partial order snapshots
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
| Hi-index | 0.00 |