Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
An Acyclic Expansion Algorithm for Fast Protocol Validation
IEEE Transactions on Software Engineering
petri—a UNIX tool for the analysis of Petri nets
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
The derivation of test cases from SDL specifications
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Formal specification and validation of ISO transport protocol components, using petri nets
SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium
Decidability of the termination problem for completely specified protocols
Distributed Computing
Verification of programs with half-duplex communication
Information and Computation
Verification of programs with half-duplex communication
Information and Computation
Calibrating embedded protocols on asynchronous systems
Information Sciences: an International Journal
Verification of ISO ACSE protocol specified in Estelle
Computer Communications
Case study: Protocol converter validation through deductive inference: a case study
Computer Communications
| Hi-index | 0.00 |
In a complete protocol design process, it is often important to validate the protocol for general correctness properties such as boundedness, deadlock absence, and well-formedness. However, for any general protocol modeled as a number of communicating finite state machines with unbounded FIFO channels, the above properties are known to be undecidable [Brand81a, Brand80a]. In this paper we demonstrate the decidability of those properties for a class of protocols, called well-ordered protocols. We introduce an algorithm for constructing a finite reachability tree for any given protocol with FIFO channels and show that by using this reachability tree, one can decide whether any given protocol is well-ordered, and if it is well-ordered whether it has an unbounded channel, a state deadlock, or an unspecified reception.