Testing equivalence as a bisimulation equivalence
Proceedings of the international workshop on Automatic verification methods for finite state systems
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Another Look at LTL Model Checking
Formal Methods in System Design
Weakest-Congruence Results for Livelock-Preserving Equivalences
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Techniques for Smaller Intermediary BDDs
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Propositional Temporal Logics and Equivalences
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On-the-Fly Verification of Linear Temporal Logic
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Petri Net Analysis Using Boolean Manipulation
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Verification and diagnosis of testing equivalence and reduction relation
ICNP '95 Proceedings of the 1995 International Conference on Network Protocols
SPOT: An Extensible Model Checking Library Using Transition-Based Generalized Büchi Automata
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Efficient symbolic state-space construction for asynchronous systems
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Proceedings of the 14th international SPIN conference on Model checking software
Symbolic Abstraction and Deadlock-Freeness Verification of Inter-enterprise Processes
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Symbolic abstraction and deadlock-freeness verification of inter-enterprise processes
Data & Knowledge Engineering
Self-loop aggregation product: a new hybrid approach to on-the-fly LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Checking soundness of business processes compositionally using symbolic observation graphs
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
A counterexample-based incremental and modular verification approach
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
| Hi-index | 0.00 |
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the well-known state explosion problem. During the last two decades, numerous techniques have been proposed to cope with the state explosion problem in order to get a manageable state space. Among them, on-the-flymodel-checking allows for generating only the "interesting" part of the model while symbolic model-checkingaims at checking the property on a compact representation of the system by using Binary Decision Diagram (BDD) techniques. In this paper, we propose a technique which combines these two approaches to check LTL茂戮驴X state-based properties over finite systems. During the model checking process, only an abstraction of the state space of the system, namely the symbolic observation graph, is (possibly partially) explored. The building of such an abstraction is guided by the property to be checked and is equivalent to the original state space graph of the system w.r.t. LTL茂戮驴X logic (i.e. the abstraction satisfies a given formula φiff the system satisfies φ). Our technique was implemented for systems modeled by Petri nets and compared to an explicit model-checker as well as to a symbolic one (NuSMV) and the obtained results are very competitive.