Minimum/maximum delay testing of product lines with unbounded parametric real-time constraints

Luthmann, Lars; Gerecht, Timo; Stephan, Andreas; Bürdek, Johannes; Lochau, Malte

doi:10.1016/j.jss.2018.12.028

Cited by 9 publications

(8 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our approach first parameterizes the initial timed automata, abstracting it into a PTA, generates some tests, and then refines the abstraction by identifying only those TAs contained in the PTA that correctly evaluate all the tests. As future work, we plan to adopt also other formalisms to build the abstraction where to look for the repaired timed automata; The CoPtA model [143], for example, extends timed automata with feature models and allows to specify additional/alternative states and transitions. In addition, when the oracle acts as a white-box, i. e., when the oracle is able to test language equivalence, we could also make use of learning techniques for timed automata despite the undecidability of the language inclusion problem, using the almost-always terminating procedure for language inclusion in [208].…”

Section: Discussionmentioning

confidence: 99%

“…In this case, the user should refine the abstraction by parameterizing some other clock guards, or by relaxing the constraints on some existing parameters. Moreover, it could be that the correct oracle has a different structure (additional states and transitions): as future work, we plan to apply other abstractions as CoPtA models [143] that allow to parametrize states and transitions.…”

Section: Synchronized Product and Synthesismentioning

confidence: 99%

See 1 more Smart Citation

Using software testing to repair models

Radavelli

2019

Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of

View full text Add to dashboard Cite

and colleagues at university, in particular Justyna Petke, Paolo Vavassori, Silvia Bonfanti, and Andrea Bombarda, for their contribution throughout my PhD, not only scientifically, but also on a human perspective. A special thank I wish to give to Yu Lei, his family and his team at University of Texas at Arlington for the encouragement and the support in research activities. Thanks to Dimitris Simos and his team at SBA Research in Vienna, for his guidance and openness in collaborating with me.Thanks also to the co-supervisor of my M.Sc. thesis, Prof. Sarah Nadi, for having solicited in me a curiosity for the topics in software product lines, and giving me many clues on how to approach research.Finally, I wish to thank the many kind people (researchers and not) with whom I had the pleasure to interact during the journey to produce this thesis.I would like to thank the University of Bergamo for making it possible.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Synchronized Product and Synthesismentioning

confidence: 99%

Using software testing to repair models

Radavelli

2019

Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of

View full text Add to dashboard Cite

show abstract

“…Our approach generates an abstraction of the initial TA in terms of a PTA, generates some tests, and then refines the abstraction by identifying only those TAs contained in the PTA that correctly evaluate all the tests. As future work, we plan to adopt also other formalisms to build the abstraction where to look for the repaired timed automata; The CoPtA model [Lut+19], for example, extends timed automata with feature models and allows to specify additional/alternative states and transitions. In addition, when the oracle acts as a white-box, i. e., when the oracle is able to test language equivalence, we could also make use of learning techniques for timed automata despite the undecidability of the language inclusion problem, using the often terminating procedure for language inclusion in [Wan+14].…”

Section: Discussionmentioning

confidence: 99%

“…In this case, the user should refine the abstraction by parameterizing some other clock guards, or by relaxing the constraints on some existing parameters. Moreover, it could be that the correct oracle has a different structure (additional states and transitions): as future work, we plan to apply other abstractions as CoPtA models [Lut+19] that allow to parametrize states and transitions.…”

Section: Discussing Assumptionmentioning

confidence: 99%

Repairing Timed Automata Clock Guards through Abstraction and Testing

André,

Arcaini,

Gargantini

et al. 2019

Preprint

View full text Add to dashboard Cite

Timed automata (TAs) are a widely used formalism to specify systems having temporal requirements. However, exactly specifying the system may be difficult, as the user may not know the exact clock constraints triggering state transitions. In this work, we assume the user already specified a TA, and (s)he wants to validate it against an oracle that can be queried for acceptance. Under the assumption that the user only wrote wrong guard transitions (i. e., the structure of the TA is correct), the search space for the correct TA can be represented by a Parametric Timed Automaton (PTA), i. e., a TA in which some constants are parametrized. The paper presents a process that (i) abstracts the initial (faulty) TA tainit in a PTA pta; (ii) generates some test data (i. e., timed traces) from pta; (iii) assesses the correct evaluation of the traces with the oracle; (iv) uses the IMITATOR tool for synthesizing some constraints ϕ on the parameters of pta; (v) instantiate from ϕ a TA tarep as final repaired model. Experiments show that the approach is successfully able to partially repair the initial design of the user.

show abstract

“…-the parametric verification of an asynchronous memory circuit by ST-Microelectronics (from a model described in [37]), -verification of parametric scheduling problems by Astrium Space Transportation [40] and ArianeGroup SAS [13], -analysis of music scores [38], -verifying the multi-processor image processing system of an unmanned aerial aircraft with uncertain periods, as a benchmark made public by Thales [46], -parametric pattern matching and monitoring of logs from the automative industry [20], -synthesis of timing/cost parameters in attack-fault trees [23,31], -testing product lines using parametric constraints [44], -verification of an industrial asynchronous leader election algorithm by Thales using IMITATOR combined with abstractions [18], -performing parametric opacity analyses for timed automata [30], and -synthesis of parameter valuations guaranteeing liveness properties for the Bounded Retransmission Protocol [11].…”

Section: A Selection Of Applicationsmentioning

confidence: 99%

IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability

André

2021

Computer Aided Verification

View full text Add to dashboard Cite

Real-time systems are notoriously hard to verify due to nondeterminism, concurrency and timing constraints. When timing constants are uncertain (in early the design phase, or due to slight variations of the timing bounds), timed model checking techniques may not be satisfactory. In contrast, parametric timed model checking synthesizes timing values ensuring correctness. takes as input an extension of parametric timed automata (PTAs), a powerful formalism to formally verify critical real-time systems. extends PTAs with multi-rate clocks, global rational-valued variables and a set of additional useful features. We describe here the new features and algorithms offered by 3, that moved along the years from a simple prototype dedicated to robustness analysis to a standalone parametric model checker for timed systems.

show abstract

Minimum/maximum delay testing of product lines with unbounded parametric real-time constraints

Cited by 9 publications

References 16 publications

Using software testing to repair models

Using software testing to repair models

Repairing Timed Automata Clock Guards through Abstraction and Testing

IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability

Contact Info

Product

Resources

About