Unbounded Verification Results by Finite-State Compositional Techniques: 10^any States and Beyond

Authors:
Antti Valmari;Ilkka Kokkarinen
Affiliations:
-;-
Venue:
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
Year:
1998

Citing 0
Cited 10

Refactoring design models for inductive verification

ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Composition and Abstraction

MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Process Spaces

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Partial S-Invariants for the Verification of Infinite Systems Families

ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Tackling the Infinite State Space of a Multimedia Control Protocol Service Specification

ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Composition and abstraction

Modeling and verification of parallel processes
Automatic verification for a class of distributed systems

Distributed Computing
Fast verification of the class of stop-and-wait protocols modelled by coloured Petri nets

Nordic Journal of Computing
Using parametric automata for the verification of the stop-and-wait class of protocols

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A parametric state space for the analysis of the infinite class of stop-and-wait protocols

SPIN'06 Proceedings of the 13th international conference on Model Checking Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article describes how to use process-algebraic compositional finite-state verification techniques for infinite parameterised families of systems. The parameter is incremented by adding a new process, and automated techniques establish that this does not change the externally observable behaviour. Therefore, all systems in the family behave identically. Channel fairness and independence of retransmission bounds are used as examples.