Results 31 to 40 of about 133,366 (251)
Timed Automata Robustness Analysis via Model Checking [PDF]
Logical Methods in Computer Science, 2022 Timed automata (TA) have been widely adopted as a suitable formalism to model time-critical systems. Furthermore, contemporary model-checking tools allow the designer to check whether a TA complies with a system specification.
Jaroslav Bendík +3 more
doaj +1 more source
Efficient Detection of Zeno Runs in Timed Automata [PDF]
, 2007 Zeno runs, where infinitely many actions occur in finite time, may inadvertently arise in timed automata specifications. Zeno runs may compromise the reliability of formal verification, and few model-checkers provide the means to deal with them: this ...
Gomez, Rodolfo, Bowman, Howard
core +1 more source
Modeling Decentralized Real-Time Control by State Space Partition of Timed Automata [PDF]
, 2005 Timed automata provide useful state machine based representations for the validation and verification of realtime control systems. This paper introduces an algorithmic methodology to translate the state space visualization of a centralized real-time ...
S. Chennu +5 more
core +1 more source
Modal Specifications for Probabilistic Timed Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Modal automata are a classic formal model for component-based systems that comes equipped with a rich specification theory supporting abstraction, refinement and compositional reasoning.
Tingting Han +3 more
doaj +1 more source
Model checking of continuous-time Markov Chains against timed automata specifications [PDF]
, 2011 We study the verification of a finite continuous-time Markov chain (CTMC) C against a linear real-time specification given as a deterministic timed automaton (DTA) A with finite or Muller acceptance conditions.
Jagadeesan, R. +14 more
core +3 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 +1 more source
Two Way Concurrent Buffer System without Deadlock in Various Time Models Using Timed Automata [PDF]
, 2014 Two way buffer system is a system that exhibits transfer of data using two buffers concurrently. It includes processes that synchronize to exchange data with each other along with executing certain delays between these synchronizations.
Rohit Mishra, Md Zeeshan and Sanjay Singh
core +1 more source
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