Results 261 to 270 of about 17,423 (281)
Some of the next articles are maybe not open access.
2016
Timed automata are a widely used formalism for modeling real-time systems, which is employed in a class of successful model checkers such as UPPAAL. These tools can be understood as trust-multipliers: we trust their correctness to deduce trust in the safety of systems checked by these tools. However, mistakes have previously been made.
openaire +1 more source
Timed automata are a widely used formalism for modeling real-time systems, which is employed in a class of successful model checkers such as UPPAAL. These tools can be understood as trust-multipliers: we trust their correctness to deduce trust in the safety of systems checked by these tools. However, mistakes have previously been made.
openaire +1 more source
2010
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real-valued variables called clocks. Recursive timed automata are finite collections of timed automata extended with special states that correspond to (potentially recursive ...
Ashutosh Trivedi 0001, Dominik Wojtczak
openaire +1 more source
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real-valued variables called clocks. Recursive timed automata are finite collections of timed automata extended with special states that correspond to (potentially recursive ...
Ashutosh Trivedi 0001, Dominik Wojtczak
openaire +1 more source
Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice
ACM Computing Surveys, 2023Johan Arcile, Étienne André
exaly
Transformations of timed cooperating automata
Fundam. Informaticae, 2000Summary: The paper pursues the investigation of Timed Cooperating Automata (TCA) by studying transformations which are suggested as means for stepwise TCA contruction.
LANOTTE, RUGGERO +3 more
openaire +5 more sources
A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata
2009Timed Automata with Deadlines (TAD) are a form of timed automata that admit a more natural representation of urgent actions, with the additional advantage of avoiding the most common form of timelocks. We offer a compositional translation of a practically useful subset of TAD to timed safety automata (the well-known variant of timed automata where time
openaire +1 more source
A survey of timed automata for the development of real-time systems
Computer Science Review, 2013Juergen Dingel, Karen Rudie
exaly
Improved undecidability results on weighted timed automata
Information Processing Letters, 2006Patricia Bouyer +2 more
exaly
Conformance Tests for Real-Time Systems with Timed Automata Specifications
Formal Aspects of Computing, 2000Rachel M Cardell-Oliver
exaly
The efficiency of identifying timed automata and the power of clocks
Information and Computation, 2011Sicco Verwer +2 more
exaly
Reachability in two-clock timed automata is PSPACE-complete
Information and Computation, 2015John Fearnley, Marcin Jurdzinski
exaly