The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Stepwise refinement of communicating systems
Science of Computer Programming
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
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
Temporal Verification of Simulation and Refinement
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
PLTL-partitioned model checking for reactive systems under fairness assumptions
ACM Transactions on Embedded Computing Systems (TECS)
Experiments in the use of τ-simulations for the components-verification of real-time systems
Proceedings of the 2006 conference on Specification and verification of component-based systems
The Composition of Event-B Models
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Partitioned PLTL model-checking for refined transition systems
Information and Computation
How to verify and exploit a refinement of component-based systems
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Introducing dynamic properties with past temporal operators in the b refinement
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Verification of LTL on b event systems
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
B model slicing and predicate abstraction to generate tests
Software Quality Control
| Hi-index | 0.00 |
We are interested in verifying dynamic properties of reactive systems. The reactive systems are specified by a B event systems in a refinement development. We use labelled transition systems to express the semantics of these event systems on which we define a refinement relation. The main advantage is that the user does not need to express a variant and a loop invariant to obtain automatic proofs of dynamic properties, at least for finite state event systems. Another advantage is that the model-checking is done on an abstraction with few states and the property is preserved in the following refinements of the system. The originality of this work concerns the proof that this refinement relation preserves the properties expressed with propositional linear temporal logic.