On-the-fly verification of finite transition systems

Fernandez, Jean-Claude; Mounier, Laurent; Jard, Claude; Jéron, Thierry

doi:10.1007/bf00121127

Cited by 47 publications

(15 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…-On-the-fly verification (see e.g., [9,8,21,31,29]) consists of enumerating the states and transitions in an order determined by a property of interest, thus enabling one to find property violations before the whole system graph has been generated. -Compositional verification (see e.g., [7, 28, 41, 44, 46, 6, 38, 16, 24, 39, 14, 11]) consists of replacing individual processes by property-preserving abstractions of limited size.…”

Section: Introductionmentioning

confidence: 99%

Partial Order Reductions Using Compositional Confluence Detection

Lang

Mateescu

2009

FM 2009: Formal Methods

View full text Add to dashboard Cite

Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consist of inspecting the states and transitions of a graph representation of the system. Their main limitation is state explosion, which happens when the graph is too large to be stored in the available computer memory. Several techniques can be used to palliate state explosion, such as on-the-fly verification, compositional verification, and partial order reductions. In this paper, we propose a new technique of partial order reductions based on compositional confluence detection (Ccd), which can be combined with the techniques mentioned above. Ccd is based upon a generalization of the notion of confluence defined by Milner and exploits the fact that synchronizing transitions that are confluent in the individual processes yield a confluent transition in the system graph. It thus consists of analysing the transitions of the individual process graphs and the synchronization structure to identify such confluent transitions compositionally. Under some additional conditions, the confluent transitions can be given priority over the other transitions, thus enabling graph reductions. We propose two such additional conditions: one ensuring that the generated graph is equivalent to the original system graph modulo branching bisimulation, and one ensuring that the generated graph contains the same deadlock states as the original system graph. We also describe how Ccd-based reductions were implemented in the Cadp toolbox, and present examples and a case study in which adding Ccd improves reductions with respect to compositional verification and other partial order reductions.

show abstract

Section: Introductionmentioning

confidence: 99%

Partial Order Reductions Using Compositional Confluence Detection

Lang

Mateescu

2009

FM 2009: Formal Methods

View full text Add to dashboard Cite

show abstract

“…Classical approaches are graph compressions and forward checking [9,10]. ✓ Other techniques construct a reduced reachability graph associated to the original, based on some properties to preserve [4,12].…”

Section: Approachmentioning

confidence: 99%

European railway traffic management system validation using UML/Petri nets modelling strategy

Jabri¹,

Koursi²,

Bourdeaud’huy

et al. 2010

Eur. Transp. Res. Rev.

View full text Add to dashboard Cite

Purpose The European Union set up a European management system for rail traffic: the ERTMS system to ensure, in full safety, train circulation on different European networks. As the full deployment of this system is long and expensive, evolutions are necessary and raise other technological challenges. The goal is to determine how to use ERTMS specifications to produce test scenarios. This paper presents methods, models and tools dedicated to the generation of test scenarios for the validation of ERTMS components based on functional requirements. Methods The development of ERTMS system requires adequate methods for modelling and checking its behaviour. Evaluation and certification of the system can be done by generating test scenarios applying formal methods. The Unified Modelling Language (UML) is a widely accepted modelling standard in industry. However, it is a semi-formal language and it does not allow verification of system behaviour. In this case, formal models like Petri Net can be used. Results These methods are used in order to formalize ERTMS specification. Tests scenarios are generated on the basis of Petri net models. One scenario is considered like a firing sequence in the reachability graph of the Petri net. Then, test scenarios are applied on ERTMS platform simulator in order to check the components and to give test verdicts. Conclusions Finally, the approach, developed in this paper, has been applied to ERTMS components in order to demonstrate the validation and certification costs reduction and also to minimize the upgrade and retrofit constraints and validation cost.

show abstract

“…On-the-fly verification (e.g., [16,15,38,33,46,45]) consists in performing Lts generation and verification at the same time. This avoids to generate the entire Lts when the verification only requires a part of it.…”

Section: Introductionmentioning

confidence: 99%

Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods

Lang

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

It is desirable to integrate formal verification techniques applicable to different languages. We present Exp.Open 2.0, a new tool of the Cadp verification toolbox which combines several features. First, Exp.Open 2.0 allows to describe concurrent systems as a composition of finite state machines, using either synchronization vectors, or parallel composition, hiding, renaming, and cut operators from several process algebras (Ccs, Csp, Lotos, E-Lotos, µCrl). Second, together with other tools of Cadp, Exp.Open 2.0 allows state space generation and on-the-fly exploration. Third, Exp.Open 2.0 implements on-the-fly partial order reductions to avoid the generation of irrelevant interleavings of independent transitions. Fourth, Exp.Open 2.0 allows to export models towards other tools using interchange formats such as automata networks and Petri nets. Finally, we show some practical applications and measure the efficiency of Exp.Open 2.0 on several benchmarks.

show abstract

On-the-fly verification of finite transition systems

Cited by 47 publications

References 25 publications

Partial Order Reductions Using Compositional Confluence Detection

Partial Order Reductions Using Compositional Confluence Detection

European railway traffic management system validation using UML/Petri nets modelling strategy

Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods

Contact Info

Product

Resources

About