Results 1 to 10 of about 133,366 (251)
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 +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 +5 more
doaj +1 more source
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 +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 +2 more
doaj +1 more source
MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Parametric timed automata extend timed automata (Alur and Dill, 1991) in that they allow the specification of parametric bounds on the clock values. Since their introduction in 1993 by Alur, Henzinger, and Vardi, it is known that the emptiness problem ...
Karin Quaas
doaj +1 more source
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
Improved Undecidability Results for Reachability Games on Recursive Timed Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is
Shankara Narayanan Krishna +2 more
doaj +1 more source
A Secure Smart Contract Generation Method Based on Timed Automata [PDF]
Jisuanji gongcheng, 2023 Blockchain is a decentralized computing paradigm with promising application prospects in many fields. Smart contracts are the key to blockchain applications; however, security issues with smart contracts often occur, occasionally leading to significant ...
Yang LIU, Shengjie ZHANG
doaj +1 more source
On Nonlinear Prices in Timed Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Priced timed automata provide a natural model for quantitative analysis of real-time systems and have been successfully applied in various scheduling and planning problems.
Devendra Bhave +2 more
doaj +1 more source