Communicating sequential processes
Communicating sequential processes
Limits for automatic verification of finite-state concurrent systems
Information Processing Letters
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
A New Structural Induction Theorem for Rings of Temporal Petri Nets
IEEE Transactions on Software Engineering
An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm
Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XI
Model Checking Large-Scale and Parameterized Resource Allocation Systems
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards the Automated Verification of Multithreaded Java Programs
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Unifying Approach to Data-Independence
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Reducing Model Checking of the Many to the Few
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
An Approach to the Verification of Symmetric Parameterized Distributed Systems
Programming and Computing Software
Structural Conditions for Model-checking of Parameterized Networks
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Verification of parametric concurrent systems with prioritised FIFO resource management
Formal Methods in System Design
Optimizing lock protocols for native XML processing
Data & Knowledge Engineering
Parameterised Process Algebraic Verification by Precongruence Reduction
ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
Verifying parameterized taDOM+ lock managers
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Empirically efficient verification for a class of infinite-state systems
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automated multiparameterised verification by cut-offs
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
| Hi-index | 0.01 |
We consider parameterised verification problem, where parameters are sets and relations over these sets, typically used to denote sets of identities of replicated components and connections between the components. A specification and a system are given as (multiply) parameterised labelled transition systems, parameter values are encoded using first-order logic and correctness is understood as the traces refinement. We provide an algorithm that reduces the (infinite) set of parameter values to a finite one without changing the answer to the verification task, which can be then solved with the aid of existing tools. To the best of our knowledge, the algorithm is the most general one that is both complete and applicable to systems with multiple and nested parameters.