Results 41 to 50 of about 17,423 (281)
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
Theoretical Computer Science, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jan Springintveld +2 more
openaire +3 more sources
, 1999 Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see[CK96] for a survey). In model checking, a high level description of a system is compared against a logical correctness requirement to discover inconsistencies.
openaire +2 more sources
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
Optimal infinite scheduling for multi-priced timed automata [PDF]
, 2008 This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes ...
A Dasdan +28 more
core +4 more sources
Analyzing Timed Systems Using Tree Automata [PDF]
, 2016 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
Akshay, S. +2 more
core +2 more sources
Improving search order for reachability testing in timed automata [PDF]
, 2015 Standard algorithms for reachability analysis of timed automata are sensitive to the order in which the transitions of the automata are taken. To tackle this problem, we propose a ranking system and a waiting strategy. This paper discusses the reason why
Herbreteau, Frédéric, Tran, Thanh-Tung
core +3 more sources
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