On-the-fly analysis of systems with unbounded, lossy FIFO channels
- 1 January 1998
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 305-318
- https://doi.org/10.1007/bfb0028754
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurationsLecture Notes in Computer Science, 1997
- Undecidable Verification Problems for Programs with Unreliable ChannelsInformation and Computation, 1996
- Verifying Programs with Unreliable ChannelsInformation and Computation, 1996
- Unreliable Channels Are Easier to Verify Than Perfect ChannelsInformation and Computation, 1996
- Symbolic verification with periodic setsLecture Notes in Computer Science, 1994
- Data flow analysis of communicating finite state machinesACM Transactions on Programming Languages and Systems, 1991
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- Finite state description of communication protocolsComputer Networks (1976), 1978
- Ordering by Divisibility in Abstract AlgebrasProceedings of the London Mathematical Society, 1952