Emptiness Is Decidable for Asynchronous Cellular Machines
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Product Interval Automata: A Subclass of Timed Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
An expressively complete linear time temporal logic for Mazurkiewicz traces
Information and Computation - Special issue: LICS'97
Keeping track of the latest gossip in a distributed system
Distributed Computing
Muller message-passing automata and logics
Information and Computation
| Hi-index | 0.00 |