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

Lang, Frédéric

doi:10.1007/11589976_6

Cited by 51 publications

(63 citation statements)

References 52 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For our purpose, we use the Cadp (Construction and Analysis of Distributed Processes) toolbox [9] dedicated to the formal specification and verification of concurrent asynchronous systems. Cadp accepts as input specifications written in process algebraic languages, such as Lotos [13], Fsp [18,26] or Chp [19,27], as well as networks of communicating automata given in the Exp language [16]. These formal specifications are translated by specialized compilers into labeled transition systems (Ltss), i.e., state spaces modeling exhaustively the dynamic behavior of the specified systems.…”

Section: Analysis Of Discrete-time Ltssmentioning

confidence: 99%

Formal Modeling and Discrete-Time Analysis of BPEL Web Services

Mateescu¹,

Rampacek

2008

Lecture Notes in Business Information Processing

View full text Add to dashboard Cite

Abstract. Web services are increasingly used for building enterprise information systems according to the Service Oriented Architecture (Soa) paradigm. We propose in this paper a tool-equipped methodology allowing the formal modeling and analysis of Web services described in the Bpel language. The discrete-time transition systems modeling the behavior of Bpel descriptions are obtained by an exhaustive simulation based on a formalization of Bpel semantics using the Algebra of Timed Processes (Atp). These models are then analyzed by model checking value-based temporal logic properties using the Cadp toolbox. The approach is illustrated with the design of a Web service for Gps navigation.

show abstract

Section: Analysis Of Discrete-time Ltssmentioning

confidence: 99%

Formal Modeling and Discrete-Time Analysis of BPEL Web Services

Mateescu¹,

Rampacek

2008

Lecture Notes in Business Information Processing

View full text Add to dashboard Cite

show abstract

“…As regards the model of concurrency on which we establish our results, we use the following network model named "network of Ltss", in which the composition hierarchy is completely flattened. The network of Ltss model is more general than the parallel composition operator defined in the previous section, and the parallel composition, renaming, hiding and cutting operators from many process algebras can be translated into networks of Ltss [27]. Networks of Ltss thus make our work non-specific to a particular process algebra and permit an easier way of reasoning about the synchronization structure of systems.…”

Section: Refined Interface Generationmentioning

confidence: 99%

“…Synchronization rules must obey the following admissibility properties, which forbid cutting, synchronizations and renaming of τ transitions and therefore ensure that safety equivalence and stronger relations (e.g., observational, branching, and strong equivalences) are congruences for networks of Lts [27]:…”

Section: Definition 5 (Network Of Ltss) Let • /mentioning

confidence: 99%

“…Refined interface generation is implemented as an option (-interface) of the Exp.Open 2.0 tool [27] for on-the-fly verification of products of communicating Ltss, which can be combined using the following operators:…”

Section: Implementation In the Cadp Toolboxmentioning

confidence: 99%

“…As regards practical aspects, we implemented refined interface generation in the Exp.Open 2.0 tool for on-the-fly verification of networks of Ltss [27] of Cadp. Interfaces can be generated automatically from systems made of Ltss composed using operators taken from several languages (Ccs [29], Csp [4], μCrl [21], Lotos [22], the E-Lotos international standard [24], and general concurrent specification formalisms).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Refined Interfaces for Compositional Verification

Lang

2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The compositional verification approach of Graf & Steffen aims at avoiding state space explosion for individual processes of a concurrent system. It relies on interfaces that express the behavioural constraints imposed on each process by synchronization with the other processes, thus preventing the exploration of states and transitions that would not be reachable in the global state space. Krimm & Mounier, and Cheung & Kramer proposed two techniques to generate such interfaces automatically. In this paper, we propose a refined interface generation technique, in which the interface of a process is derived automatically from the examination of (a subset of) concurrent processes. This technique is applicable to formalisms in which concurrent processes are composed either using synchronization vectors or process algebra parallel composition operators (including those of Ccs, Csp, μCrl, Lotos, and E-Lotos), for which we developed a tool. Several experiments indicate state space reductions by more than two orders of magnitude for the largest processes.

show abstract

Specification and Analysis of Asynchronous Systems using CADP

Mateescu¹

2008

Modeling and Verification of Real‐Time Systems

View full text Add to dashboard Cite

Abstract. The design of complex industrial critical systems involving asynchronous parallelism requires the use of formal methods, assisted by appropriate verification tools, in order to detect and correct errors as early as possible. In this paper, we illustrate the use of the Cadp toolbox for the formal modeling and verification of such systems by considering as an example a unit dedicated to the drilling of metal products. We describe in the Lotos language two different versions of the unit, supervised by a sequential and a parallel controller, respectively. Then, we perform the generation and minimisation of the two underlying state spaces, and also the inspection (visual checking) of the smaller one, corresponding to the version equipped with a sequential controller. Finally, we analyse the behaviour of the two versions of the drilling unit by means of two complementary verification methods, based on bisimulations (equivalence checking) and temporal logics (model checking).

show abstract

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

Cited by 51 publications

References 52 publications

Formal Modeling and Discrete-Time Analysis of BPEL Web Services

Formal Modeling and Discrete-Time Analysis of BPEL Web Services

Refined Interfaces for Compositional Verification

Specification and Analysis of Asynchronous Systems using CADP

Contact Info

Product

Resources

About