Current trends in concurrency. Overviews and tutorials
Composition of nets Via a communication medium
APN 90 Proceedings on Advances in Petri nets 1990
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Petri Nets for System Engineering: A Guide to Modeling, Verification, and Applications
Petri Nets for System Engineering: A Guide to Modeling, Verification, and Applications
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Techniques for Smaller Intermediary BDDs
CONCUR '01 Proceedings of the 12th 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
Adding Partial Orders to Linear Temporal Logic
CONCUR '97 Proceedings of the 8th 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
A Client-Server Protocol for the Composition of Petri Nets
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Induction in Compositional Model Checking
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Modular Analysis of Systems Composed of Semiautonomous Subsystems
ACSD '04 Proceedings of the Fourth International Conference on Application of Concurrency to System Design
Learning assumptions for compositional verification
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A BDD-Like implementation of an automata package
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Modular verification of petri nets properties: a structure-based approach
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Decompositional Petri Net Reductions
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
A counterexample-based incremental and modular verification approach
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
Local Verification Using a Distributed State Space
Fundamenta Informaticae
| Hi-index | 0.00 |
Model-checking is a powerful and widespread technique for the verification of finite state concurrent systems. However, the main hindrance for wider application of this technique is the well-known state explosion problem. Modular verification is a promising natural approach to tackle this problem. It is based on the "divide and conquer" principle and aims at deducing the properties of the system from those of its components analysed in isolation. Unfortunately, several issues make the use of modular verification techniques difficult in practice. First, deciding how to partition the system into components is not trivial and can have a significant impact on the resources needed for verification. Second, when model-checking a component in isolation, how should the environment of this component be described? In this paper, we address these problems in the framework of model-checking LTL茂戮驴X action-based properties on Petri nets. We propose an incremental and modular verification approach where the system model is partitioned according to the actions occurring in the property to be verified and where the environment of a component is taken into account using the linear place invariants of the system.