Reactive Systems: Modelling, Specification and Verification; is written by L. Aceto, et al; and published by Cambridge University Press; distributed by Cambridge University Press; © 2007, (hardback), ISBN 978-0-521-87546-2, pp. 300

Ben-Menachem, Mordechai

doi:10.1145/1811226.1811243

Cited by 2 publications

(5 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To define the relation M A RM P , we have to establish a step by step correspondence between M A and M P . First, we introduce the notion of the timed probabilistic bisimulation relation (Ben-Menachem, 2010;Segala, 1995) in Definitions 9 and 10. This relation is based on the probabilistic equivalence relation R defined in Definition 8 where d/R denotes the quotient space of d with respect to R and R is the lifting of R to a probabilistic space.…”

Section: The Transformation Soundnessmentioning

confidence: 99%

A quantitative verification framework of SysML activity diagrams under time constraints

Baouya

Bennouar

Mohamed

et al. 2015

Expert Systems with Applications

View full text Add to dashboard Cite

a b s t r a c tTime-constrained and probabilistic verification approaches gain a great importance in system behavior validation including avionic, transport risk assessment, automotive systems and industrial process controllers. They enable the evaluation of system behavior according to the design requirements and ensure their correctness before any implementation. Due to the difficulty of analyzing, modeling and verifying these large scale systems, we introduce a novel verification framework based on PRISM probabilistic model checker that takes the SysML activity diagram as input and produce their equivalent timed probabilistic automata that is/are expressed in PRISM language. To check the functional correctness of the system under test, the properties are expressed in PCTL temporal logic. To prove the soundness of our mapping approach, we capture the underlying semantics of both the SysML activity diagrams and their generated PRISM code. We found that the timed probabilistic equivalence relation between both semantics preserve the satisfaction of the system requirements. We present digital camera as case study to illustrate the applicability of the proposed approach and to demonstrate its efficiency by analyzing a performability properties.

show abstract

Section: The Transformation Soundnessmentioning

confidence: 99%

A quantitative verification framework of SysML activity diagrams under time constraints

Baouya

Bennouar

Mohamed

et al. 2015

Expert Systems with Applications

View full text Add to dashboard Cite

show abstract

“…The semantics of a timed automaton can be described with a timed labeled transition system (TLTS) [1]. Let A = (L, Act, l 0 , E,C) be a timed automaton over a set of clocks C and a set of visible actions Act.…”

Section: Semanticsmentioning

confidence: 99%

“…Here we describe how we can in general generate a simpler formula using a fragment of the logic described in [14]. The logic we use for generating the distinguishing formula has been described in [1] which is a timed extension of Hennessy-Milner logic and does not contain any recursion as opposed to the logic used in [14]. The set M t of Hennessy-Milner logic formulae with time over a set of actions Act, set D of formula clocks (distinct from the clocks of any timed automaton) is generated by the abstract syntax…”

Section: Deciding Timed Bisimulationmentioning

confidence: 99%

“…Time abstracted bisimulation between two timed automata has been shown to be decidable [1][16] using the region graph construction [3]. Two timed automata are timed abstracted bisimilar if and only if their region graphs are strongly bisimilar.…”

Section: Deciding Time Abstracted Bisimulationmentioning

confidence: 99%

“…It is known that given two timed automata, checking whether they accept the same timed language is undecidable [3]. However, bisimulation equivalences between timed automata have been shown to be decidable [1][4] [16] [22]. The decidability of timed bisimilarity between two timed automata was proved in [4] via a product construction on region graphs.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Unifying Approach to Decide Relations for Timed Automata and their Game Characterization

Guha

Krishna

Narayan

et al. 2013

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

In this paper we present a unifying approach for deciding various bisimulations, simulation equivalences and preorders between two timed automata states. We propose a zone based method for deciding these relations in which we eliminate an explicit product construction of the region graphs or the zone graphs as in the classical methods. Our method is also generic and can be used to decide several timed relations. We also present a game characterization for these timed relations and show that the game hierarchy reflects the hierarchy of the timed relations. One can obtain an infinite game hierarchy and thus the game characterization further indicates the possibility of defining new timed relations which have not been studied yet. The game characterization also helps us to come up with a formula which encodes the separation between two states that are not timed bisimilar. Such distinguishing formulae can also be generated for many relations other than timed bisimilarity.

show abstract

Reactive Systems: Modelling, Specification and Verification; is written by L. Aceto, et al; and published by Cambridge University Press; distributed by Cambridge University Press; © 2007, (hardback), ISBN 978-0-521-87546-2, pp. 300

Cited by 2 publications

References 0 publications

A quantitative verification framework of SysML activity diagrams under time constraints

A quantitative verification framework of SysML activity diagrams under time constraints

A Unifying Approach to Decide Relations for Timed Automata and their Game Characterization

Contact Info

Product

Resources

About