Symbolic Test Selection Based on Approximate Analysis

Jeannet, Bertrand; Jéron, Thierry; Rusu, Vlad; Zinovieva, Elena

doi:10.1007/978-3-540-31980-1_23

Cited by 55 publications

(61 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Each operation on sets is performed by a predicate transformer (for example Pre δ (B) is given by the set of states ν, which satisfy the predicate transformer ∃ν ∈ B : (ν ∈ G δ ) ∧ (ν = A δ (ν)). Details can be found in Le Gall et al (2005) and in Jeannet et al (2005).…”

Section: Symbolic Transition Systemsmentioning

confidence: 99%

Symbolic Supervisory Control of Infinite Transition Systems Under Partial Observation Using Abstract Interpretation

Kalyon

Gall

Marchand

et al. 2011

Discrete Event Dyn Syst

View full text Add to dashboard Cite

We propose algorithms for the synthesis of state-feedback controllers with partial observation of infinite state discrete event systems modelled by Symbolic Transition Systems. We provide models of safe memoryless controllers both for potentially deadlocking and deadlock free controlled systems. The termination of the algorithms solving these problems is ensured using abstract interpretation techniques which provide an overapproximation of the transitions to disable. We then extend our algorithms to controllers with memory and to online controllers. We also propose improvements in the synthesis of controllers in the finite case which, to our knowledge, provide more permissive solutions than what was previously proposed in the literature. Our tool SMACS gives an empirical validation of our methods by showing their feasibility, usability and efficiency.

show abstract

Section: Symbolic Transition Systemsmentioning

confidence: 99%

Symbolic Supervisory Control of Infinite Transition Systems Under Partial Observation Using Abstract Interpretation

Kalyon

Gall

Marchand

et al. 2011

Discrete Event Dyn Syst

View full text Add to dashboard Cite

show abstract

“…For example, Pre T δ (B) is given by the set of states ν which satisfy the predicate transformer ∃ν ∈ B : (ν ∈ G δ ) ∧ (ν = A δ (ν)). Further details can be found in Le Gall et al (2005); Jeannet et al (2005).…”

Section: Remarkmentioning

confidence: 99%

Decentralized Control of Infinite Systems

Kalyon

Gall

Marchand

et al. 2011

Discrete Event Dyn Syst

View full text Add to dashboard Cite

We propose algorithms for the synthesis of decentralized statefeedback controllers with partial observation of infinite state systems, which are modeled by Symbolic Transition Systems. We first consider the computation of safe controllers ensuring the avoidance of a set of forbidden states and then extend this result to the deadlock free case. The termination of the algorithms solving these problems is ensured by the use of abstract interpretation techniques, but at the price of overapproximations, in particular, in the computation of the states which must be avoided. We then extend our algorithms to the case where the system to be controlled is given by a collection of subsystems (modules). This structure is exploited to locally compute a controller for each module. Our tool SMACS gives an empirical evaluation of our methods by showing their feasibility, usability and efficiency.

show abstract

“…As both problems are undecidable for IOSTS, syntactical transformations are guided by over-approximations using abstract interpretation techniques. Nevertheless, these over-approximations still ensure soundness of test cases [26]. These techniques are implemented in the STG tool (see 5.1), with an interface with NBAC used for abstract interpretation.…”

Section: Automatic Test Generationmentioning

confidence: 99%