Communicating sequential processes
Communicating sequential processes
Limits for automatic verification of finite-state concurrent systems
Information Processing Letters
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
Reducing Model Checking of the Many to the Few
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)
Classification Algorithms for Codes and Designs (Algorithms and Computation in Mathematics)
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
Algorithmic Verification with Multiple and Nested Parameters
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Cut-Offs with Network Invariants
ACSD '10 Proceedings of the 2010 10th International Conference on Application of Concurrency to System Design
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
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We consider multiparameterised process algebraic verification, where parameters are sets and binary relations over these sets used to respectively denote the sets of the identities of replicated components and the topology of a system. There is a cut-off result that enables such a parameterised verification task to be reduced to a finite set of finite-state ones, but no practical way to perform reduction, i.e. to compute the parameter values up to the cut-offs. The first contribution of the paper is an improved formalism that enables parameterised systems and specifications to be expressed with fewer parameters than before. The second one is a search-tree-based algorithm for computing the parameter values up to the cut-offs. The algorithm detects and discards isomorphic parameter values and is equipped with a heuristic to prune a search tree. The algorithm is implemented and the relevance of the contributions is justified by practical computations.