Results 1 to 10 of about 4,872 (300)
Scheduling with timed automata [PDF]
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eugene Asarin, Oded Maler
exaly +6 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 +6 more
doaj +4 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 +2 more
openaire +6 more sources
Alternating timed automata [PDF]
ACM Transactions on Computational Logic, 2005 A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages that is closed under boolean operations and which has an effective presentation.
Slawomir Lasota 0001, Igor Walukiewicz
core +7 more sources
On Implementable Timed Automata [PDF]
Formal Techniques for Distributed Objects, 2020 Generating code from networks of timed automata is a well-researched topic with many proposed approaches, which have in common that they not only generate code for the processes in the network, but necessarily generate additional code for a global scheduler which implements the timed automata semantics.
Feo-Arenis S, Vujinović M, Westphal B.
europepmc +4 more sources
Analyzing Timed Systems Using Tree Automata [PDF]
Logical Methods in Computer Science, 2018 Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract properties, such
S. Akshay +2 more
doaj +3 more sources
IEEE Transactions on Software Engineering, 2008 Timed automata have proven to be useful for specification and verification of real-time systems. System design using timed automata relies on explicit manipulation of clock variables. A number of automated analyzers for timed automata have been developed. However, timed automata lack composable patterns for high-level system design.
Jun Sun, Shengchao Qin, Jin Song Dong
exaly +4 more sources
Corrections to “A Menagerie of Timed Automata” [PDF]
ACM Computing Surveys, 2017 This note corrects a technical error in the ACM Computing Surveys article mentioned in the title. The flaw involved constructions for showing that timed automata with urgent locations have the same expressiveness as timed automata that allow false location invariants.
Rance Cleaveland, Jeroen J A Keiren
exaly +6 more sources
Perturbed Timed Automata [PDF]
, 2005 We consider timed automata whose clocks are imperfect.
ALUR R +2 more
openaire +5 more sources
Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities [PDF]
Logical Methods in Computer Science, 2021 Clock-dependent probabilistic timed automata extend classical timed automata with discrete probabilistic choice, where the probabilities are allowed to depend on the exact values of the clocks.
Jeremy Sproston
doaj +1 more source