Automated logical verification based on trace abstractions
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Classes of Timed Automata and the Undecidability of Universality
Fundamenta Informaticae
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
On the refinement of liveness properties of distributed systems
Formal Methods in System Design
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Classes of Timed Automata and the Undecidability of Universality
Fundamenta Informaticae
Hi-index | 0.89 |