From Scenarios to Timed Automata

@inproceedings{Saeedloei2017FromST,
  title={From Scenarios to Timed Automata},
  author={Neda Saeedloei and Feliks Kluzniak},
  booktitle={SBMF},
  year={2017}
}
We describe a new method of synthesizing a formal model for real-time systems from scenarios. Scenarios, formally defined as Timed Event Sequences, together with mode graphs are used to describe behaviors of real-time systems. Given a set of Timed Event Sequences and a mode graph, our synthesis method constructs a minimal, acyclic, timed automaton that models the specified aspects of the system. We formalize criteria that a set of scenarios must satisfy in order to make it feasible to generate… 
Timed Scenarios: Consistency, Equivalence and Optimization
TLDR
A new method is developed for determining the consistency of timed scenarios and is able to minimize the largest constant in the scenario’s set of constraints, directly relevant to decreasing the costs of verification for timed automata synthesized from timed scenarios.
Optimal Clock Allocation for a Class of Timed Automata
TLDR
This work addresses the problem of allocating a minimal number of clocks to timed automata, TADS, for which there is an algorithm whose complexity is quadratic in the size of the graph.
Clock Allocation in Timed Automata and Graph Colouring
TLDR
A class of timed automata, TADS ⊊ TAS, is described, for which optimal clock allocation can be computed in polynomial time, because the corresponding interference graphs are perfect.
Formal Methods: Foundations and Applications: 23rd Brazilian Symposium, SBMF 2020, Ouro Preto, Brazil, November 25–27, 2020, Proceedings
TLDR
This work argues that the popularity of machine learning comes from the fact that no formal specification exists which renders traditional verification inappropriate, and presents a recent technique that allows to check certain properties for an underlying recurrent neural network and may be uses as a tool to identify whether the system learned is right.
Minimization of the Number of Clocks for Timed Scenarios

References

SHOWING 1-10 OF 21 REFERENCES
From scenarios to timed automata: building specifications from users requirements
TLDR
The paper presents an incremental algorithm that synthesizes timed automata from scenarios with timing constraints based on a formalism developed for scenarios.
Towards Scenario-Based Synthesis for Parametric Timed Automata
TLDR
This paper explores how to extend approaches to synthesize the operational state-based behavior of a set of components for scenarios with parametric timing constraints in form of upper and lower time bounds.
Symbolic Computation of Schedulability Regions Using Parametric Timed Automata
TLDR
This paper proposes a novel and general method, based on parametric timed automata, for symbolically computing the region in the parameter's space that guarantees a feasible schedule, given a set of real-time tasks characterised by aSet of parameters and by an activation pattern.
A really temporal logic
TLDR
TPTL is demonstrated to be both a natural specification language and a suitable formalism for verification and synthesis and several generalizations of TPTL are shown to be highly undecidable.
Optimal Clock Allocation for a Class of Timed Automata
TLDR
This work addresses the problem of allocating a minimal number of clocks to timed automata, TADS, for which there is an algorithm whose complexity is quadratic in the size of the graph.
Synthesis of Behavioral Models from Scenarios
TLDR
An MSC language with sound abstract semantics is defined and a sound synthesis algorithm is provided which translates scenarios into a behavioral specification in the form of Finite Sequential Processes, providing the basis for a common approach to scenario-based specification, synthesis, and analysis.
Clock Allocation in Timed Automata and Graph Colouring
TLDR
A class of timed automata, TADS ⊊ TAS, is described, for which optimal clock allocation can be computed in polynomial time, because the corresponding interference graphs are perfect.
Synthesis of Partial Behavior Models from Properties and Scenarios
TLDR
A novel synthesis technique is proposed that constructs behavior models in the form of modal transition systems (MTS) from a combination of safety properties and scenarios to describe both universal constraints provided by requirements and existential statements provided by scenarios.
Timing Constraints in Message Sequence Chart Specifications
TLDR
An analysis technique for timing consistency in iterating and branching MSC specifications is described and efficient current techniques for timing analysis of MSCs with no loops nor branchings are extended.
Model Checking and the State Explosion Problem
TLDR
This lecture notes will explain how the basic model checking algorithms work and describe some recent approaches to the state explosion problem, with an emphasis on Bounded Model Checking.
...
...