Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning

Authors:
Gianfranco Ciardo;Andy Jinqing Yu
Affiliations:
Dept. of Computer Science and Engineering, Univ. of California, Riverside;Dept. of Computer Science and Engineering, Univ. of California, Riverside
Venue:
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Year:
2005

Citing 17
Cited 12

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Reachability analysis using partitioned-ROBDDs

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
On the stochastic structure of parallelism and synchronization models for distributed algorithms
Model checking

Model checking
To split or to conjoin: the question in image computation

Proceedings of the 37th Annual Design Automation Conference
Symbolic guided search for CTL model checking

Proceedings of the 37th Annual Design Automation Conference
Symbolic Model Checking

Symbolic Model Checking
Border-Block Triangular Form and Conjunction Schedule in Image Computation

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Traversal Techniques for Concurrent Systems

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Symbolic Reachability Analysis Based on SAT-Solvers

TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
NUSMV: A New Symbolic Model Verifier

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Petri Net Analysis Using Boolean Manipulation

Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Fine-Grain Conjunction Scheduling for Symbolic Reachability Analysis

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A Data Structure for the Efficient Kronecker Solution of GSPNs

PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Saturation for a General Class of Models

QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Saturation unbound

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems

Symbolic Reachability for Process Algebras with Recursive Data Types

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Symbolic Reachability Analysis of Integer Timed Petri Nets

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Advanced features in SMART: the stochastic model checking analyzer for reliability and timing

ACM SIGMETRICS Performance Evaluation Review
Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation

ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Bounded reachability checking of asynchronous systems using decision diagrams

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Data representation and efficient solution: a decision diagram approach

SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Improving static variable orders via invariants

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Approximate steady-state analysis of large Markov models based on the structure of their decision diagram encoding

Performance Evaluation
Implicit representations and algorithms for the logic and stochastic analysis of discrete–state systems

EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
A fine-grained fullness-guided chaining heuristic for symbolic reachability analysis

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
New metrics for static variable ordering in decision diagrams

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new saturation-based symbolic state-space generation algorithm for finite discrete-state systems. Based on the structure of the high-level model specification, we first disjunctively partition the transition relation of the system, then conjunctively partition each disjunct. Our new encoding recognizes identity transformations of state variables and exploits event locality, enabling us to apply a recursive fixed-point image computation strategy completely different from the standard breadth-first approach employing a global fix-point image computation. Compared to breadth-first symbolic methods, saturation has already been empirically shown to be several orders more efficient in terms of runtime and peak memory requirements for asynchronous concurrent systems. With the new partitioning, the saturation algorithm can now be applied to completely general asynchronous systems, while requiring similar or better run-times and peak memory than previous saturation algorithms.