On the progress of communication between two finite state machines
Information and Control
Reduction and covering of infinite reachability trees
Information and Computation
Design and validation of computer protocols
Design and validation of computer protocols
Testing for unboundedness of fifo channels
STACS '91 Selected papers of the 8th annual symposium on Theoretical aspects of computer science
Unreliable channels are easier to verify than perfect channels
Information and Computation
Undecidable verification problems for programs with unreliable channels
Information and Computation
Verifying identical communicating processes is undecidable
Theoretical Computer Science
On Communicating Finite-State Machines
Journal of the ACM (JACM)
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Using Formal Description Techniques: An Introduction to Estelle, Lotos, and SDL
Using Formal Description Techniques: An Introduction to Estelle, Lotos, and SDL
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
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
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Verifying Systems with Infinite but Regular State Spaces
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
The Minimal Coverability Graph for Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract)
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Symbolic Verification with Periodic Sets
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Well-abstracted transition systems: application to FIFO automata
Information and Computation
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
Reachability analysis of protocols with FIFO channels
SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
Decidability of the termination problem for completely specified protocols
Distributed Computing
Hi-index | 0.01 |
We consider the analysis of infinite half-duplex systems made of finite state machines that communicate over unbounded channels. The half-duplex property for two machines and two channels (one in each direction) says that each reachable configuration has at most one channel non-empty. We prove in this paper that such half-duplex systems have a recognizable reachability set. We show how to compute, in polynomial time, a symbolic representation of this reachability set and how to use that description to solve several verification problems. Furthermore, though the model of communicating finite state machines is Turing-powerful, we prove that membership of the class of half-duplex systems is decidable. Unfortunately, the natural generalization to systems with more than two machines is Turing-powerful. We also prove that the model-checking of those systems against PLTL (propositional linear temporal logic) or CTL (computational tree logic) is undecidable. Finally, we show how to apply the previous decidability results to the Regular Model Checking. We propose a new symbolic reachability semi-algorithm with accelerations which successfully terminates on half-duplex systems of two machines and some interesting non-half-duplex systems.