Results 1 to 10 of about 17,423 (281)
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 +4 more sources
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
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 +4 more sources
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 +3 more sources
Verification for Timed Automata extended with Unbounded Discrete Data Structures [PDF]
Logical Methods in Computer Science, 2015 We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack.
Karin Quaas
doaj +4 more sources
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 +4 more sources
Weak Alternating Timed Automata [PDF]
Logical Methods in Computer Science, 2012 Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable.
Pawel Parys, Igor Walukiewicz
doaj +5 more sources
A Formal Model For Real-Time Parallel Computation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The imposition of real-time constraints on a parallel computing environment– specifically high-performance, cluster-computing systems– introduces a variety of challenges with respect to the formal verification of the system's timing properties.
Peter Hui, Satish Chikkagoudar
doaj +4 more sources
Sampled Semantics of Timed Automata [PDF]
Logical Methods in Computer Science, 2010 Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes it appealing ...
Pavel Krcal +2 more
doaj +5 more sources
Re-verification of a Lip Synchronization Protocol using Robust Reachability [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 The timed automata formalism is an important model for specifying and analysing real-time systems. Robustness is the correctness of the model in the presence of small drifts on clocks or imprecision in testing guards.
Piotr Kordy +2 more
doaj +8 more sources