Deciding LTL over Mazurkiewicz traces
Data & Knowledge Engineering - Special issue: Temporal representation and reasoning
Alternating Automata and Logics over Infinite Words
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Alternation Elimination by Complementation (Extended Abstract)
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
The complexity of temporal logic with until and since over ordinals
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Antichains: alternative algorithms for LTL satisfiability and model-checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Symbolic algorithm for generation büchi automata from LTL formulas
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Reasoning about transfinite sequences
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Concepts of automata construction from LTL
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Bounded model checking for weak alternating büchi automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Truly on-the-fly LTL model checking
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Deeper connections between LTL and alternating automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Hi-index | 0.00 |