Results 21 to 30 of about 133,366 (251)

Parametric updates in parametric timed automata [PDF]

Logical Methods in Computer Science, 2021
We introduce a new class of Parametric Timed Automata (PTAs) where we allow clocks to be compared to parameters in guards, as in classic PTAs, but also to be updated to parameters.
Étienne André, Didier Lime, Mathias Ramparison   +2 more
doaj   +1 more source

Simulations for Event-Clock Automata [PDF]

Logical Methods in Computer Science
Event-clock automata (ECA) are a well-known semantic subclass of timed automata (TA) which enjoy admirable theoretical properties, e.g., determinizability, and are practically useful to capture timed specifications.
S Akshay, Paul Gastin, R Govind, B Srivathsan   +3 more
doaj   +1 more source

Robustness in Timed Automata [PDF]

, 2013
In this paper we survey several approaches to the robustness of timed automata, that is, the ability of a system to resist to slight perturbations or errors.
Markey, Nicolas, Markey, Nicolas N., Patricia Bouyer, Ocan Sankur, Bouyer, Patricia, Sankur, Ocan, Bouyer, Patricia P., Nicolas Markey   +7 more
core   +1 more source

Non-blocking supervisory control for initialised rectangular automata [PDF]

, 2004
We consider the problem of supervisory control for a class of rectangular automata and more specifically for compact rectangular automata with uniform rectangular activity, i.e. initialised.
Spathopoulos, M.P., Spathopoulos, Michael P.   +1 more
core   +3 more sources

Stochastic Timed Automata [PDF]

Logical Methods in Computer Science, 2014
A stochastic timed automaton is a purely stochastic process defined on a timed automaton, in which both delays and discrete choices are made randomly.
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Groesser, Marcin Jurdzinski   +6 more
doaj   +1 more source

Verification for Timed Automata extended with Unbounded Discrete Data Structures [PDF]

Logical Methods in Computer Science, 2015
We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack.
Karin Quaas
doaj   +1 more source

Performance analysis of probabilistic timed automata using digital clocks [PDF]

, 2006
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a modelling formalism suitable for describing formally both nondeterministic and probabilistic aspects of real-time systems, and is amenable to
Kwiatkowska, M., Parker, D., Norman, G., Sproston, J., Sproston, Jeremy James   +4 more
core   +1 more source

Automated Predicate Abstraction for Real-Time Models [PDF]

Electronic Proceedings in Theoretical Computer Science, 2009
We present a technique designed to automatically compute predicate abstractions for dense real-timed models represented as networks of timed automata. We use the CIPM algorithm in our previous work which computes new invariants for timed automata control
Bahareh Badban, Stefan Leue, Jan-Georg Smaus   +2 more
doaj   +1 more source

Relating timed and register automata [PDF]

Electronic Proceedings in Theoretical Computer Science, 2010
Timed automata and register automata are well-known models of computation over timed and data words respectively. The former has clocks that allow to test the lapse of time between two events, whilst the latter includes registers that can store data ...
Diego Figueira, Piotr Hofman, Sławomir Lasota   +2 more
doaj   +1 more source

Weak Alternating Timed Automata [PDF]

Logical Methods in Computer Science, 2012
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable.
Pawel Parys, Igor Walukiewicz
doaj   +1 more source