Results 41 to 50 of about 517 (162)
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 +1 more source
A Parametric Counterexample Refinement Approach for Robust Timed Specifications [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Robustness analyzes the impact of small perturbations in the semantics of a model. This allows to model hardware imprecision and therefore it has been applied to determine implementability of timed automata. In a recent paper, we extend this problem to a
Louis-Marie Traonouez
doaj +1 more source
A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Timed-arc Petri nets (TAPN) are a well-known time extension of the Petri net model and several translations to networks of timed automata have been proposed for this model.
Lasse Jacobsen +3 more
doaj +1 more source
History-deterministic Timed Automata [PDF]
Logical Methods in Computer ScienceWe explore the notion of history-determinism in the context of timed automata (TA) over infinite timed words. History-deterministic (HD) automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-
Sougata Bose +4 more
doaj +1 more source
Latency Evaluation of SDFGs on Heterogeneous Processors Using Timed Automata
IEEE Access, 2020 Synchronous Data Flow (SDF) is a graphical computation model used for analyzing digital signal processing and real time multimedia applications. In general, these applications have two primary performance metrics - throughput and latency.
Sivashankari Rajadurai +3 more
doaj +1 more source
Timed Automata Semantics for Analyzing Creol [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We give a real-time semantics for the concurrent, object-oriented modeling language Creol, by mapping Creol processes to a network of timed automata. We can use our semantics to verify real time properties of Creol objects, in particular to see whether ...
Mohammad Mahdi Jaghoori, Tom Chothia
doaj +1 more source
Interrupt Timed Automata [PDF]
, 2009 In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single processor environment. This model is a subclass of hybrid automata. While reachability is undecidable for hybrid automata we show that in ITA the reachability problem is in 2EXPSPACE and ...
Bérard, Béatrice, Haddad, Serge
openaire +2 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 +1 more source
Dynamic Timed Automata for Reconfigurable System Modeling and Verification
Axioms, 2023 Modern discrete-event systems (DESs) are often characterized by their dynamic structures enabling highly flexible behaviors that can respond in real time to volatile environments.
Samir Tigane +5 more
doaj +1 more source
Model Checking One-clock Priced Timed Automata [PDF]
Logical Methods in Computer Science, 2008 We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical ...
Patricia Bouyer +2 more
doaj +1 more source