Unreliable channels are easier to verify than perfect channels
Information and Computation
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Protocol Description and Analysis Based on a State Transition Model with Channel Expressions
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
Information and Computation
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
Decidability of the termination problem for completely specified protocols
Distributed Computing
Alternation-free modal mu-calculus for data trees
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Computational Logic (TOCL)
The Ordinal Recursive Complexity of Lossy Channel Systems
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
A theory of regular MSC languages
Information and Computation
Verification of probabilistic systems with faulty communication
Information and Computation
Simulating perfect channels with probabilistic lossy channels
Information and Computation
Post embedding problem is not primitive recursive, with applications to channel systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
The ω-regular post embedding problem
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Analysis of communicating automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Unidirectional channel systems can be tested
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Reachability of communicating timed processes
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
The parametric ordinal-recursive complexity of post embedding problems
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We consider asynchronous networks of finite-state systems communicating via a combination of reliable and lossy fifo channels. Depending on the topology, the reachability problem for such networks may be decidable. We provide a complete classification of network topologies according to whether they lead to a decidable reachability problem. Furthermore, this classification can be decided in polynomial-time.