Results 1 to 10 of about 8,331 (215)
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 +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 +2 more
doaj +10 more sources
Compiling Real-time Scenarios into a Timed Automaton [PDF]
, 2006 In this paper, we aim at synthesizing an executable specification for a real-time system by integrating real-time scenarios into a timed automaton. A scenario represents a partial description of a system behavior. A formal semantics is given for the model of a scenario and is used to compile a scenario into a timed automaton.
Aziz Salah, Rachida Dssouli, Guy Lapalme
openaire +3 more sources
A Maximal Entropy Stochastic Process for a Timed Automaton, [PDF]
Information and Computation, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicolas Basset
openaire +6 more sources
Two-Player Reachability-Price Games on Single-Clock Timed Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We study two player reachability-price games on single-clock timed automata. The problem is as follows: given a state of the automaton, determine whether the first player can guarantee reaching one of the designated goal locations. If a goal location can
Michal Rutkowski
doaj +4 more sources
Exact acceleration of complex real-time model checking based on overlapping cycle [PDF]
PeerJ Computer Science, 2020 When real-time systems are modeled as timed automata, different time scales may lead to substantial fragmentation of the symbolic state space. Exact acceleration solves the fragmentation problem without changing system reachability. The relatively mature
Guoqing Wang +5 more
doaj +3 more sources
On the Equivalence of Automaton-Based Representations of Time Granularities [PDF]
14th International Symposium on Temporal Representation and Reasoning (TIME'07), 2007 A time granularity can be viewed as the partitioning of a temporal domain in groups of elements, where each group is perceived as an indivisible unit. In this paper we explore an automaton-based approach to the management of time granularity that compactly represents time granularities as single-string automata with counters, that is, Buchi automata ...
DAL LAGO Ugo +2 more
openaire +5 more sources
Universal Time-Symmetric Number-Conserving Cellular Automaton [PDF]
, 2015 We show the existence of Turing-universal and intrinsically universal cellular automata exhibiting both time symmetry and number conservation; this is achieved by providing a way to simulate reversible CA with time-symmetric CA, which preserves the number-conserving property.
Diego Maldonado +2 more
openaire +3 more sources
Model Checking of Time Petri Nets Using the State Class Timed Automaton [PDF]
Discrete Event Dynamic Systems, 2006 In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We consider bounded TPN, whose underlying net is not necessarily bounded. We prove that our translation preserves the behavioural semantics of the TPN (the initial TPN and the ...
Lime, Didier, Roux, Olivier Henri
+8 more sources
Model-Checking Real-Time Systems: Revisiting the Alternating Automaton Route [PDF]
Abstract Alternating timed automata (ATA) are an extension of timed automata, that are closed under complementation and hence amenable to logic-to-automata translations. Several timed logics, including Metric Temporal Logic (MTL), can be converted to equivalent 1-clock ATAs (1-ATAs).
Bouyer, Patricia +2 more
+6 more sources