Share This Author
IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems
The new version Imitator 2.5 integrates the new features of stopwatches and updates and updates (in addition to standard clock resets), as well as powerful algorithmic improvements for state space reduction, which make the tool well-suited to analyze the robustness of solutions in several classes of preemptive scheduling problems.
Modeling and verifying hierarchical real-time systems using stateful timed CSP
The PAT model checker is extended to support system modeling and verification using Stateful Timed CSP and show its usability/scalability via verification of real-world systems.
An Inverse Method for Parametric Timed Automata
What’s decidable about parametric timed automata?
- É. André
- Computer ScienceInternational Journal on Software Tools for…
- 1 April 2019
A survey of decision and computation problems for PTAs, including formalisms close to parametric timed automata (such as parametric hybrid automata or parametric interrupt timedAutomata), and tools dedicated to PTAs and their extensions are studied.
IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata
- É. André
- Computer ScienceICTAC
- 12 August 2009
The aim of Imitator is to generate a constraint such that, under any valuation satisfying this constraint, the system is guaranteed to behave, in terms of alternating sequences of locations and actions, as under the reference valuation.
A Formal Semantics for Complete UML State Machines with Communications
This work proposes a formal operational semantics covering all features of the latest version (2.4.1) of UML state machines specification, and uses labelled transition systems as the semantic model, so as to use automatic verification techniques like model checking.
Automated runtime recovery for QoS-based service composition
This work proposes an automated approach based on a genetic algorithm to calculate the recovery plan that could guarantee the satisfaction of functional properties of the composite service after recovery.
Observer Patterns for Real-Time Systems
- É. André
- Computer Science18th International Conference on Engineering of…
- 17 July 2013
A set of correctness patterns encoding common properties met when verifying concurrent real-time systems are proposed and it is shown how to translate these patterns into pure reachability problems, thus avoiding the use of complex verification algorithms.
Learning Assumptions for Compositional Verification of Timed Systems
This work proposes a compositional verification framework using a learning algorithm for automatic construction of timed assumptions for AGR, and proves the correctness and termination of the proposed learning-based framework.
IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata
- É. André
- Computer ScienceINFINITY
- 28 October 2010
We present here Imitator II, a new version of Imitator, a tool implementing the "inverse method" for parametric timed automata: given a reference valuation of the parameters, it synthesizes a…