Timed I/O Automata
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
... that timed automata and bounded RA-TdPN s are language ...to timed automata with integral constants over (possibly Zeno) infinite timed words, which contrasts with the finite or ...
12
Robust Reachability in Timed Automata: A Game-Based Approach
... of timed automata is an idealization of real timed ...in timed automata that strategies can choose the delays with arbitrary ...
50
Consistency in Parametric Interval Probabilistic Timed Automata
... the timed setting and in the probabilistic setting. In the timed setting, parametric timed automata [5] allow using parameter variables in the guards of timed transitions in order to ...
11
Structural translation from time petri nets to timed automata
... propose Timed Automata with Deadlines and flexible notions of ...a timed automaton with deadlines (TAD) where the discrete transition structure is the corresponding marking ...
27
When are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?
... Our Contribution. In this work, we give a characterization of the maximal subclass T A wtb of timed automata which admit a weakly timed bisimilar TPN. This condition is not intuitive and relates to ...
34
When are Timed Automata weakly timed bisimilar to Time Petri Nets ?
... & Toussaint compare Timed State Machines (TSM) and Time Petri Nets. They give a translation from TSM to TPN that preserves timed languages. Our Contribution. In this work, we consider TPNs and ...
19
Symbolic Unfoldings for Networks of Timed Automata
... of timed automata, we deal with timed events which are pairs (e, δ) where δ ∈ R ≥0 ...of timed events E is feasible iff there is a run in the NTA that generates a timed word that ...
16
When are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?
... Our Contribution. In this work, we give a characterization of the maximal subclass T A wtb of timed automata which admit a weakly timed bisimilar TPN. This condition is not intuitive and relates to ...
33
Infinite Runs in Weighted Timed Automata with Energy Constraints
... priced) timed automata and games [3, 2] into a universal formalism useful for formulating and solving a broad range of resource scheduling problems of importance in application areas such as, ...and ...
16
On timed automata with input-determined guards
... determined automata will use guards of the form “I ∈ ∆”, where I is an interval and ∆ is an operator which determines for a given timed word σ and a position i in it, a set of intervals ...
18
Online Timed Pattern Matching using Automata
... of timed automata. Timed Automata We use a variant of timed automata, finite-state automata extended with real-valued clock variables, as acceptors of timed ...
18
Structural Translation of Time Petri Nets into Timed Automata
... of Timed Transition ...to Timed Automata (TA) that preserves the behavioural semantics (timed bisimilarity) of the ...two-fold: i) reachability problems and more generally TCTL ...
21
Modelling Attack-defense Trees Using Timed Automata
... difficult to perform an adequate risk assessment of an organisation’s security stance, with many organisations relying on a complex mix of off-site third party IT-services, e.g., “cloud services” and internally ...
17
Integer-Complete Synthesis for Bounded Parametric Timed Automata
... problem. Timed automata (TA) [ AD94 ] are a powerful formalism for which many interesting problems (including the reachability of a location) are ...Parametric timed automata (PTA) [ AHV93 ] ...
18
Backward Symbolic Optimal Reachability in Weighted Timed Automata
... plain timed automata ...for timed automata, lifting them to the weighted case in the spirit of [17], by encoding in zones the accumulated weight to the goal, instead of the accumulated weight ...
18
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
... that timed automata and bounded RA-TdPN s are language ...to timed automata with integral constants over (possibly Zeno) infinite timed words, which contrasts with the finite or ...
12
Revisiting Bounded Reachability Analysis of Timed Automata Based on MILP
... of timed automata (TA) to a Mixed Integer Linear Programming (MILP) ...of timed automata has been explored in the literature based on the satisfiability of Boolean con- straint formulas over ...
16
Efficient Emptiness Check for Timed Büchi Automata
... Introduction Timed automata [1] are widely used to model real-time ...finite automata by adding clocks that can be reset and whose values can be compared with ...of timed automata is ...
22
A game approach to determinize timed automata
... 5.2 Invariants We now explain how to adapt the framework to timed automata with invariants. Note that any timed automaton with invariants can be transformed into an equivalent one without invariants. ...
40
Optimal Strategies in Priced Timed Game Automata
... priced timed game automata with a strictly non-zeno ...priced timed game automata for which optimal state-based (no need to keep track of the cost information) can be ...
13