Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Software—Practice & Experience
On an improved algorithm for decentralized extrema finding in circular configurations of processors
Communications of the ACM
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Deriving Symbolic Representations from Stochastic Process Algebras
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
µCRL: A Toolset for Analysing Algebraic Specifications
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Description and formal specification of the Link Layer of P1394
Description and formal specification of the Link Layer of P1394
SMART: The Stochastic Model checking Analyzer for Reliability and Timing
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Verification of a sliding window protocol in μCRL and PVS
Formal Aspects of Computing
The saturation algorithm for symbolic state-space exploration
International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems
A Database Approach to Distributed State Space Generation
Electronic Notes in Theoretical Computer Science (ENTCS)
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
CADP 2006: a toolbox for the construction and analysis of distributed processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
An embeddable virtual machine for state space generation
Proceedings of the 14th international SPIN conference on Model checking software
Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
State Space Reduction of Linear Processes Using Control Flow Reconstruction
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Behavioural Analysis of an I2C Linux Driver
FMICS '09 Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
LTSMIN: distributed and symbolic reachability
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Using model checking to analyze the system behavior of the LHC production grid
Future Generation Computer Systems
| Hi-index | 0.00 |
In this paper, we present a symbolic reachability algorithm for process algebras with recursive data types. Like the various saturation based algorithms of Ciardo et al, the algorithm is based on partitioning of the transition relation into events whose influence is local. As new features, our algorithm supports recursive data types and allows unbounded non-determinism, which is needed to support open systems with data. The algorithm does not use any specific features of process algebras. That is, it will work for any system that consists of a fixed number of communicating processes, where in each atomic step only a subset of the processes participate. As proof of concept we have implemented the algorithm in the context of the μCRL toolset. We also compared the performance of this prototype with the performance of the existing explicit tools on a set of typical case studies.