Results 11 to 20 of about 17,423 (281)

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   +4 more sources

Timed pushdown automata revisited [PDF]

2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015
This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of Abdulla et al. collapses: it is expressively equivalent to dense-timed PDA with timeless stack. Motivated by
Clemente, Lorenzo, Lasota, Sławomir
core   +3 more sources

Better abstractions for timed automata [PDF]

Information and Computation, 2015
We consider the reachability problem for timed automata. A standard solution to this problem involves computing a search tree whose nodes are abstractions of zones.
Alur, Alur, B. Srivathsan, Behrmann, Behrmann, Behrmann, Bengtsson, Berthomieu, Bouyer, Bouyer, Bouyer, Bouyer, Daws, Dill, Frédéric Herbreteau, Gregersen, Herbreteau, Herbreteau, Herbreteau, Igor Walukiewicz, Kwiatkowska, Laroussinie, Morbé, Shostak, Tasiran, Tripakis, Wang, Yannakakis, Zhao   +28 more
core   +8 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

Determinisability of register and timed automata [PDF]

Logical Methods in Computer Science, 2022
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.
Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski   +2 more
doaj   +1 more source

Language Inclusion Checking of Timed Automata Based on Property Patterns

Applied Sciences, 2022
The language inclusion checking of timed automata is described as the following: given two timed automata M and N, where M is a system model and N is a specification model (which represents the properties that the system needs to satisfy), check whether ...
Ting Wang, Yan Shen, Tieming Chen, Baiyang Ji, Tiantian Zhu, Mingqi Lv   +5 more
doaj   +1 more source

Model Checking Probabilistic Timed Automata with One or Two Clocks [PDF]

Logical Methods in Computer Science, 2008
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks.
Marcin Jurdzinski, Francois Laroussinie, Jeremy Sproston   +2 more
doaj   +1 more source

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
openaire   +3 more sources

Concurrency in Timed Automata [PDF]

Theoretical Computer Science, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LANOTTE, RUGGERO, MAGGIOLO SCHETTINI A, TINI, SIMONE   +2 more
openaire   +5 more sources

Higher-Dimensional Timed and Hybrid Automata [PDF]

Leibniz Transactions on Embedded Systems, 2022
We introduce a new formalism of higher-dimensional timed automata, based on Pratt and van Glabbeek’s higher-dimensional automata and Alur and Dill’s timed automata.
Fahrenberg, Uli
doaj   +1 more source