Decidability of a class of dual communicating finite state machines
ACM SIGOPS Operating Systems Review
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Effective Recognizability and Model Checking of Reactive Fiffo Automata
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Verification of Embedded Reactive Fiffo Systems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Well-Abstracted Transition Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Well-abstracted transition systems: application to FIFO automata
Information and Computation
Verification of programs with half-duplex communication
Information and Computation
Verification of programs with half-duplex communication
Information and Computation
Quasi-static scheduling of communicating tasks
Information and Computation
A finite union of DFAs in symbolic model checking of infinite systems
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Monterey'08 Proceedings of the 15th Monterey conference on Foundations of Computer Software: future Trends and Techniques for Development
| Hi-index | 0.00 |