Communication and concurrency
Design and validation of computer protocols
Design and validation of computer protocols
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Automatic verification of properties in transition systems
Software—Practice & Experience
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Ready-Simulation Is Not Ready to Express a Modular Refinement Relation
FASE '00 Proceedings of the Third Internationsl Conference on Fundamental Approaches to Software Engineering: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
On the Verification of Temporal Properties
Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII
Using asynchronous Büchi automata for efficient automatic verification of concurrent systems
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Modular Model Checking of Software
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Introducing Dynamic Constraints in B
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Combining the Design of Industrial Systems with Effective Verification Techniques
FME '94 Proceedings of the Second International Symposium of Formal Methods Europe on Industrial Benefit of Formal Methods
Combining Model Checking and Theorem Proving to Verify Parallel Processes
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Combining Partial Order Reductions with On-the-fly Model-Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Modular Verification of Dynamic Properties for Reactive Systems
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Synchronized Parallel Composition of Event Systems in B
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
A formal approach for the development of reactive systems
Information and Software Technology
Combining formal methods for the development of reactive systems
International Journal of Computer Applications in Technology
Heuristics to verify LTL properties of hierarchical systems
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Combining Formal Methods for the Development of Reactive Systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
| Hi-index | 0.00 |
The verification of dynamic properties of a reactive systems by model-checking leads to a potential combinatorial explosion of the state space that has to be checked. In order to deal with this problem, we define a strategy based on local verifications rather than on a global verification. The idea is to split the system into subsystems called modules, and to verify the properties on each module in separation. We prove for a class of PLTL properties that if a property is satisfied on each module, then it is globally satisfied. We call such properties modular properties. We propose a modular decomposition based on the B refinement process. We present in this paper an usual class of dynamic properties in the shape of □(p ⇒ Q), where p is a proposition and Q is a simple temporal formula, such as ○q, ⋄q or qUr (with q and r being propositions). We prove that these dynamic properties are modular. For these specific patterns, we have exhibited some syntactic conditions of modularity on their corresponding Büchi automata. These conditions define a larger class which contains other patterns such as □(p ⇒ ○(qUr)). Finally, we show through the example of an industrial Robot that this method is valid in a practical way.