Putting advanced reachability analysis techniques together: The “ARA” tool

Valmari, Antti; Kemppainen, Jukka; Clegg, Matthew; Levanto, Mikko

doi:10.1007/bfb0024669

Cited by 25 publications

(13 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While other tools allowing to compute synchronization products are either specific to one language (e.g., Ara-Lotos [60] or Exp.Open 1.0) or implement a single low-level parallel composition operator (e.g., Mec synchronization vectors [2], Fc2 networks [8], Tvt [34], modular Petri nets [13]), Exp.Open 2.0 combines both synchronization vectors [2,8] and operators taken from several languages, namely Ccs [47], Csp [55], Lotos [39], µCrl [31], and E-Lotos [40]. To our knowledge, Exp.Open 2.0 provides the first implementation of the "graphical" parallel composition operator [23] of E-Lotos, which supports "m among n" synchronization in particular.…”

Section: Resultsmentioning

confidence: 99%

“…Most tools implementing partial order reductions (e.g., Spin [37], Ara [60], etc.) solve the ignoring problem by detecting circuits in the back-end.…”

Section: Inriamentioning

confidence: 99%

“…Although there exist tools combining two among the three aforementioned verification techniques, such as Spin [37] (partial order and on-the-fly verification) and Ara [60] (partial order and compositional verification), to our knowledge, combining the three techniques has never been done. This report is organized as follows.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Section: Resultsmentioning

confidence: 99%

“…Most tools implementing partial order reductions (e.g., Spin [37], Ara [60], etc.) solve the ignoring problem by detecting circuits in the back-end.…”

Section: Inriamentioning

confidence: 99%

See 1 more Smart Citation

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

show abstract

“…Various static analysis techniques have been proposed for verifying properties of distributed systems, which include model checking [1], inequality-necessary conditions analysis [2], data flow analysis [3,4], explicit state enumeration [5,6,7,8], and compositional reachability analysis [9,10]. Among these analysis techniques, our approach focuses on compositional reachability analysis techniques, especially based on property automata [10] due to its scalability.…”

Section: Introductionmentioning

confidence: 99%

Safety Property Analysis Techniques for Cooperating Embedded Systems Using LTS

Lee

Kim

Chae

2007

Software Technologies for Embedded and Ubiquitous Systems

View full text Add to dashboard Cite

Abstract. Safety issues of cooperating embedded systems are very important since they are closely related to our living. In this research, modeling techniques and safety analysis techniques for cooperating embedded systems are provided. Behaviors of embedded systems and safety properties are described by Labeled Transition Systems (LTS). For convenient and effective analysis, we provide a slicing method of the state space of a system according to a property. Based on the slice models, we provided an equivalence algorithm of LTS models and a compositional analysis technique of safety properties.

show abstract

“…The ARA (Advanced Reachability Analysis) toolset (Valmari et al, 1993) was used for the verification. The sizes of the largest transition systems that were encountered during the verification are shown in Table 1.…”

Section: Fischer's Protocolmentioning

confidence: 99%

Verification of Dense Time Properties Using Theories of Untimed Process Algebra

Luukkainen

Formal Techniques for Networked and Distributed Systems

View full text Add to dashboard Cite

The article shows how untimed process algebraic methods can be used in verifying a category of dense time properties from a restricted class of timed automata. The work is based on the known results that if we restrict ourselves to a certain class of timed automata, then most of the interesting dense time properties are verifiable using discrete time methods. Those results are refined here in order to fit the process algebraic context, and furthermore, reduction strategies based on behavior equivalences, compositionality and abstraction are indicated. The usability of the method is evaluated with two case studies.ity Keywords: Formal verification, Timed automata, Process algebra, Compositional- I N T R O D U C T I O NBecause of the state explosion problem, a useful principle in algorithmic verification is that the information unnecessary for a verification task should be abstracted away. Especially, we would like to see in the context of systems specified with timed automata when it is sufficient to use discrete time algorithms but still say something about the system behavior in dense time.In Henzinger et al., 1992 it was shown that for systems specified with timed transition systems, a large class of dense time properties can be verified by using discrete time algorithms. These results were generalized to timed automata in Bošna ki, 1999. In this article we show how the methods used in standard untimed process algebra, and the related tools, can be used in verifying this category of dense time properties

show abstract

Putting advanced reachability analysis techniques together: The “ARA” tool

Cited by 25 publications

References 16 publications

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

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

Safety Property Analysis Techniques for Cooperating Embedded Systems Using LTS

Verification of Dense Time Properties Using Theories of Untimed Process Algebra

Contact Info

Product

Resources

About