Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- 1 June 1999
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 221 (1-2) , 211-250
- https://doi.org/10.1016/s0304-3975(99)00033-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A theory of timed automataPublished by Elsevier ,2002
- Verifying Programs with Unreliable ChannelsInformation and Computation, 1996
- Unreliable Channels Are Easier to Verify Than Perfect ChannelsInformation and Computation, 1996
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- Testing for unboundedness of fifo channelsTheoretical Computer Science, 1993
- Data flow analysis of communicating finite state machinesACM Transactions on Programming Languages and Systems, 1991
- On Communicating Finite-State MachinesJournal of the ACM, 1983