Communicating sequential processes
Communicating sequential processes
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Numerical Analysis of Superposed GSPNs
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Exact performance equivalence: an equivalence relation for stochastic automata
Theoretical Computer Science
An Analysis of Bitstate Hashing
Formal Methods in System Design
Concurrency: state models & Java programs
Concurrency: state models & Java programs
Structured analysis approaches for large Markov chains
Applied Numerical Mathematics
Distributed Algorithms
Symbolic Model Checking
Communication and Concurrency
Hierarchical Structuring of Superposed GSPNs
IEEE Transactions on Software Engineering
Using Magnatic Disk Instead of Main Memory in the Murphi Verifier
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Reachability Analysis Based on Structured Representations
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Storage Alternatives for Large Structured State Spaces
Proceedings of the 9th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Saturation for a General Class of Models
IEEE Transactions on Software Engineering
Bisimulation relations for weighted automata
Theoretical Computer Science
Computational Probability for Systems Biology
FMSB '08 Proceedings of the 1st international workshop on Formal Methods in Systems Biology
Hi-index | 0.00 |
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized components. State spaces and transition graphs are first generated for single components. Then, we reduce the component state spaces by using a reachability-preserving equivalence relation. The reduced descriptions are used afterwards for reachability analysis. Reachability analysis is performed in an incremental way that exploits the component structure which defines the adjacency matrix of the transition graph of the complete system as a Kronecker product of small component adjacency matrices. This representation often achieves a significant reduction of the number of transition interleavings to be considered during reachability analysis. An acyclic graph is used to encode the set of reachable states. This representation is an extension of ordered binary decision diagrams and allows for a compact representation of huge sets of states. Furthermore, the full state space is easily obtained from the reduced set. The reduced or the full state space can be used in model-checking algorithms to derive detailed results about the behavior of the modeled system. The combination of the proposed techniques yields an approach suitable for extremely large state spaces, which are represented in a space-efficient way and generated and analyzed with low effort.