A Maximal Entropy Stochastic Process for a Timed Automaton by Basset, N

A Maximal Entropy Stochastic Process for a Timed Automaton by Basset, N

Model Checking for Real-Time Attack Detection in Water Distribution Systems by Francesco Mercaldo, Fabio Martinelli, Antonella Santone

Subjects: Get full text

Modeling and Verification of Uncertain Cyber-Physical System Based on Decision Processes by Na Chen, Shengling Geng, Yongming Li

Subjects: Get full text

Higher-Dimensional Timed and Hybrid Automata by Fahrenberg, Uli

Subjects: “…timed automaton…”
Get full text

Determinisability of register and timed automata by Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski

“…The deterministic membership problem for timed automata asks whether the timed language given by a nondeterministic timed automaton can be recognised by a deterministic timed automaton. …”
Get full text

Stochastic Timed Automata by Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Groesser, Marcin Jurdzinski

“…A stochastic timed automaton is a purely stochastic process defined on a timed automaton, in which both delays and discrete choices are made randomly. …”
Get full text

Relating timed and register automata by Diego Figueira, Piotr Hofman, Sławomir Lasota

“…We show that a run of a timed automaton can be simulated by a register automaton, and conversely that a run of a register automaton can be simulated by a timed automaton. …”
Get full text

Timed Automata for Modelling Caches and Pipelines by Franck Cassez, Pablo González de Aledo Marugán

“…The objective is to obtain a timed automaton model to compute tight bounds for the worst-case execution time (WCET) of the programs using model-checking techniques.…”
Get full text

Action Transducers and Timed Automata by Lynch, Nancy A., Vaandrager, Frits

“…The timed automaton model of [29, 30] is a general model for timing-based systems. …”
Get full text

Optimal multi-robot path planning with temporal logic constraints by Ulusoy, Alphan, Smith, Stephen L., Ding, Xu Chu, Belta, Calin, Rus, Daniela L.

“…Our method is guaranteed to compute an optimal set of robot paths. We utilize a timed automaton representation in order to capture the relative position of the robots in the environment. …”
Get full text
Get full text

Revisiting reachability in timed automata by Quaas, K, Shirmohammadi, M, Worrell, J

“…We revisit a fundamental result in real-time verification, namely that the binary reachability relation between configurations of a given timed automaton is definable in linear arithmetic over the integers and reals. …”

Hourglass Automata by Yuki Osada, Tim French, Mark Reynolds, Harry Smallbone

“…This is done by showing that we can construct a finite untimed graph using clock regions from any timed automaton that use this new update.…”
Get full text

MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable by Karin Quaas

“…MTL-model checking of timed automata is decidable, no matter how many clocks are used in the timed automaton. In this paper, we prove that MTL-model checking for parametric timed automata is undecidable, even if the automaton uses only one clock and one parameter and is deterministic.…”
Get full text

On the decidability and complexity of Metric Temporal Logic over finite words by Joel Ouaknine, James Worrell

“…We also consider the model-checking problem for MTL: whether all words accepted by a given Alur-Dill timed automaton satisfy a given MTL formula. We show that this problem is decidable over finite words. …”
Get full text

Sampled Semantics of Timed Automata by Pavel Krcal, Parosh Aziz Abdulla, Wang Yi

“…More formally, the \emph{sampling problem} is to decide whether there is a sampling rate such that all qualitative behaviors (the untimed language) accepted by a given timed automaton in dense time semantics can be also accepted in sampled semantics. …”
Get full text

Coarse abstractions make Zeno behaviours difficult to detect by Frédéric Herbreteau, B Srivathsan

“…An infinite run of a timed automaton is Zeno if it spans only a finite amount of time. …”
Get full text

A DYNAMIC SUPERVISION APPROACH BASED ON STOCHASTIC P-TIMED PETRI NETS: APPLICATION TO A RAILWAY TRANSPORT NETWORK by Anis M’halla

“…In this context, the developed supervision approach, based on timed automaton, aims to detect, locate failures that affect system performance and reliability. …”
Get full text

Real-Time Model-Checking: Parameters everywhere by Veronique Bruyere, Jean-Francois Raskin

“…In this paper, we study the model-checking and parameter synthesis problems of the logic TCTL over discrete-timed automata where parameters are allowed both in the model (timed automaton) and in the property (temporal formula). …”
Get full text

On the decidability of Metric Temporal Logic by Ouaknine, J, Worrell, J, Soc, I

“…We also consider the model-checking problem for MTL: whether all words accepted by a given Alur-Dill timed automaton satisfy a given MTL formula. We show that this problem is decidable over finite words. …”