Verifying Universal Properties of Parameterized Networks
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 291-303
- https://doi.org/10.1007/3-540-45352-0_24
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Abstracting WS1S Systems to Verify Parameterized NetworksPublished by Springer Nature ,2000
- Handling Global Conditions in Parametrized System VerificationPublished by Springer Nature ,1999
- Automatic verification of parameterized synchronous systemsPublished by Springer Nature ,1996
- Bringing Telecommunication Services to the People — IS&N '95Published by Springer Nature ,1995
- Model checking and abstractionACM Transactions on Programming Languages and Systems, 1994
- Reasoning about systems with many processesJournal of the ACM, 1992
- Verifying properties of large sets of processes with network invariantsLecture Notes in Computer Science, 1990
- Reasoning about networks with many identical finite state processesInformation and Computation, 1989
- Decision Problems of Finite Automata Design and Related ArithmeticsTransactions of the American Mathematical Society, 1961
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960