Results 31 to 40 of about 17,423 (281)

Real-Time Model-Checking: Parameters everywhere [PDF]

Logical Methods in Computer Science, 2007
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). Our results are as follows.
Veronique Bruyere, Jean-Francois Raskin
doaj   +1 more source

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

Shrinking timed automata

Information and Computation, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ocan Sankur, Patricia Bouyer, Nicolas Markey   +2 more
openaire   +5 more sources

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

Modelling Timeouts without Timelocks [PDF]

, 1999
We address the issue of modelling a simple timeout in timed automata. We argue that expression of the timeout in the UPPAAL timed automata model is unsatisfactory since when composed with a component behaviour, the timeout can generate timelocks.
C. Daws, J. Sifakis, L. Leonard, S. Bornot, S. Bornot, X. Nicollin   +5 more
core   +1 more source

Timed P Automata

Electronic Notes in Theoretical Computer Science, 2009
To study systems whose dynamics changes with time, an extension of timed P systems is introduced in which evolution rules may vary with time. The proposed model is a timed automaton with a discrete time domain and in which each state is a timed P system.
BARBUTI, ROBERTO, MAGGIOLO SCHETTINI, ANDREA, MILAZZO, PAOLO, TESEI L.   +3 more
openaire   +4 more sources

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

Decomposition of Timed Automata

J. Univers. Comput. Sci., 1999
JUCS - Journal of Universal Computer Science Volume Nr.
Mason,Kahn, Krishnan,Padmanabhan
openaire   +3 more sources

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. We will concentrate on robustness against timing errors which can be due to measuring errors, imprecise clocks, and unexpected runtime behaviors such as execution times that are longer or shorter ...
Patricia Bouyer, Nicolas Markey, Ocan Sankur   +2 more
openaire   +3 more sources