Symbolic verification of communication protocols with infinite state spaces using QDDs
Authors:
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 1-12
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Unreliable Channels Are Easier to Verify Than Perfect ChannelsInformation and Computation, 1996
- Undecidable verification problems for programs with unreliable channels1994
- Model-Checking in Dense Real-TimeInformation and Computation, 1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Protocol Engineering1989
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Checking that finite state concurrent programs satisfy their linear specification1985
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- Parallel program schemataJournal of Computer and System Sciences, 1969
- A note on reliable full-duplex transmission over half-duplex linksCommunications of the ACM, 1969