The Mec 5 Model-Checker

Griffault, Alain; Vincent, Aymeric

doi:10.1007/978-3-540-27813-9_43

Cited by 11 publications

(14 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several works have combined model-checking and AltaRica, the archetypal example being the MEC tool [14] that was developed at the same time as the language. More recently, Bozzano et al [12] have defined a transformation from AltaRica Dataflow to the symbolic model-checker NuSMV.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

A Model-Checking Approach to Analyse Temporal Failure Propagation with AltaRica

Albore

Zilio

Infantes

et al. 2017

Model-Based Safety and Assessment

View full text Add to dashboard Cite

OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. Abstract. The design of complex safety critical systems raises new technical challenges for the industry. As systems become more complex-and include more and more interacting functions-it becomes harder to evaluate the safety implications of local failures and their possible propagation through a whole system. That is all the more true when we add time to the problem, that is when we consider the impact of computation times and delays on the propagation of failures.We describe an approach that extends models developed for Safety Analysis with timing information and provide tools to reason on the correctness of temporal safety conditions. Our approach is based on an extension of the AltaRica language where we can associate timing constraints with events and relies on a translation into a realtime modelchecking toolset. We illustrate our method with an example that is representative of safety architectures found in critical systems.

show abstract

Section: Conclusion and Related Workmentioning

confidence: 99%

A Model-Checking Approach to Analyse Temporal Failure Propagation with AltaRica

Albore

Zilio

Infantes

et al. 2017

Model-Based Safety and Assessment

View full text Add to dashboard Cite

show abstract

“…We also include a few toy examples to further demonstrate further expressiveness of CTL * and its usefulness in verifying programs. Given that our benchmarks tackle infinite-state programs, the only existing automated tool for verifying CTL * in the finite-state setting [18] is not applicable. In Figure 4 we display the results of our benchmarks.…”

Section: (C) Our Implementationmentioning

confidence: 99%

“…Model checking CTL * [16] for finite-state programs and other decidable settings has been implemented in [18]. Their approach reduces a CTL * formula to µ-calculus using a system of fixed-point equations on relations with first-order quantifiers and equalities.…”

Section: Introductionmentioning

confidence: 99%

“…Contrarily, we seek to verify the undecidable general class of infinite-state programs supporting both control-sensitive and integer properties. Given that µ-calculus model checking is polynomial-time equivalent to the solution of parity games [15], one can conceive that the approach in [2] could potentially solve CTL * model checking if the latter were reduced to solving parity games by combining [18] and [15]. However, we note that the resulting infinite-state game would integrate the (first-order µ-calculus) property within the program making it difficult to extract invariants pertaining the program.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On Automation of CTL* Verification for Infinite-State Systems

Cook

Khlaaf

Piterman

2015

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. In this paper we introduce the first known fully automated tool for symbolically proving CTL * properties of (infinite-state) integer programs. The method uses an internal encoding which facilitates reasoning about the subtle interplay between the nesting of path and state temporal operators that occurs within CTL * proofs. A precondition synthesis strategy is then used over a program transformation which trades nondeterminism in the transition relation for nondeterminism explicit in variables predicting future outcomes when necessary. We show the viability of our approach in practice using examples drawn from device drivers and various industrial examples.

show abstract

“…The use of this logic is motivated by its ability to naturally express the definition of various notions of untimed simulations [19]. This cannot be done in other logics containing similar operators and quantifiers like CTL [17].…”

Section: µ-Calculusmentioning

confidence: 99%

An Automatic Technique for Checking the Simulation of Timed Systems

Fares

Bodeveix

Filali-Amine

et al. 2013

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. Abstract. In this paper, we suggest an automatic technique for checking the timed weak simulation between timed transition systems. The technique is an observation-based method in which two timed transition systems are composed with a timed observer. A µ-calculus property that captures the timed weak simulation is then verified on the result of the composition. An interesting feature of the suggested technique is that it only relies on an untimed µ-calculus model-checker without any specific algorithm needed to analyze the result of the composition. We also show that our simulation relation supports interesting results concerning the trace inclusion and the preservation of linear properties. Finally, the technique is validated using the FIACRE/TINA toolset.

show abstract

The Mec 5 Model-Checker

Cited by 11 publications

References 6 publications

A Model-Checking Approach to Analyse Temporal Failure Propagation with AltaRica

A Model-Checking Approach to Analyse Temporal Failure Propagation with AltaRica

On Automation of CTL* Verification for Infinite-State Systems

An Automatic Technique for Checking the Simulation of Timed Systems

Contact Info

Product

Resources

About