Results 21 to 30 of about 4,872 (300)
Horn Clauses for Communicating Timed Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Languages based on the theory of timed automata are a well established approach for modelling and analysing real-time systems, with many applications both in industrial and academic context.
Hossein Hojjat +3 more
doaj +1 more source
Zenoness for Timed Pushdown Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Timed pushdown automata are pushdown automata extended with a finite set of real-valued clocks. Additionaly, each symbol in the stack is equipped with a value representing its age.
Parosh Aziz Abdulla +2 more
doaj +1 more source
Deterministic Timed Finite State Machines: Equivalence Checking and Expressive Power [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 There has been a growing interest in defining models of automata enriched with time. For instance, timed automata were introduced as automata extended with clocks. In this paper, we study models of timed finite state machines (TFSMs), i.e., FSMs enriched
Davide Bresolin +3 more
doaj +1 more source
Adding Time to Pushdown Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 In this tutorial, we illustrate through examples how we can combine two classical models, namely those of pushdown automata (PDA) and timed automata, in order to obtain timed pushdown automata (TPDA). Furthermore, we describe how the reachability problem
Parosh Aziz Abdulla +2 more
doaj +1 more source
Robust Weighted Timed Automata and Games [PDF]
, 2013 Weighted timed automata extend timed automata with cost variables that can be used to model the evolution of various quantities. Although cost-optimal reachability is decidable (in polynomial space) on this model, it becomes undecidable on weighted ...
Markey, Nicolas +5 more
core +1 more source
Electronic Proceedings in Theoretical Computer Science, 2014 In this paper, we define the class of hourglass automata, which are timed automata with bounded clocks that can be made to progress backwards as well as forwards at a constant rate.
Yuki Osada +3 more
doaj +1 more source
Minimizable timed automata [PDF]
, 1996 State minimization plays a fundamental role in both classical automata theory and in the theory of reactive systems. Many algorithms and results are based on the fact that for each finite automaton there exists an equivalent minimum state automaton that can be effectively computed and that is unique up to isomorphism.
Springintveld, J., Vaandrager, F.W.
openaire +3 more sources
Robust Controller Synthesis in Timed Automata [PDF]
, 2013 We consider the fundamental problem of Büchi acceptance in timed automata in a robust setting. The problem is formalised in terms of controller synthesis: timed automata are equipped with a parametrised game-based semantics that models the possible ...
Reynier, Pierre-Alain +7 more
core +1 more source
Real-Time Model-Checking: Parameters everywhere [PDF]
Logical Methods in Computer Science, 2007 In this paper, we study the model-checking and parameter synthesis problems of the logic TCTL over discrete-timed automata where parameters are allowed both in the model (timed automaton) and in the property (temporal formula). Our results are as follows.
Veronique Bruyere, Jean-Francois Raskin
doaj +1 more source
Parametric updates in parametric timed automata [PDF]
Logical Methods in Computer Science, 2021 We introduce a new class of Parametric Timed Automata (PTAs) where we allow clocks to be compared to parameters in guards, as in classic PTAs, but also to be updated to parameters.
Étienne André +2 more
doaj +1 more source