Verifying parameterized networks using abstraction and regular languages
- 1 January 1995
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 395-407
- https://doi.org/10.1007/3-540-60218-6_30
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Reasoning about ringsPublished by Association for Computing Machinery (ACM) ,1995
- Reasoning about systems with many processesJournal of the ACM, 1992
- Symbolic model checking: 1020 States and beyondInformation and Computation, 1992
- Model checking and abstractionPublished by Association for Computing Machinery (ACM) ,1992
- Reasoning about networks with many identical finite state processesInformation and Computation, 1989
- A structural induction theorem for processesPublished by Association for Computing Machinery (ACM) ,1989
- Limits for automatic verification of finite-state concurrent systemsInformation Processing Letters, 1986
- 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 specificationPublished by Association for Computing Machinery (ACM) ,1985
- A Calculus of Communicating SystemsLecture Notes in Computer Science, 1980