Complete and Tractable Local Linear Time Temporal Logics over Traces
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
Difficult Configurations—On the Complexity of LTrL
Formal Methods in System Design
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Asynchronous automata-theoretic characterization of aperiodic trace languages
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 0.00 |