Compact and tractable automaton-based representations of time granularities
Theoretical Computer Science
Extending automated compositional verification to the full class of omega-regular languages
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
Automated assume-guarantee reasoning for omega-regular systems and specifications
Innovations in Systems and Software Engineering
Equivalence and inclusion problem for strongly unambiguous büchi automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Hi-index | 0.00 |