Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- 1 January 1997
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Model-Checking of Infinite Graphs Defined by Graph GrammarsElectronic Notes in Theoretical Computer Science, 1997
- Reachability analysis of pushdown automata: Application to model-checkingLecture Notes in Computer Science, 1997
- 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
- A theory of timed automataTheoretical 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
- On Context-Free LanguagesJournal of the ACM, 1966