Well-abstracted transition systems: application to FIFO automata
Information and Computation
Decidability of the termination problem for completely specified protocols
Distributed Computing
Regularity Results for FIFO Channels
Electronic Notes in Theoretical Computer Science (ENTCS)
Calibrating embedded protocols on asynchronous systems
Information Sciences: an International Journal
Reachability Problems in Piecewise FIFO Systems
ACM Transactions on Computational Logic (TOCL)
Piecewise FIFO channels are analyzable
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
| Hi-index | 0.01 |