Results 31 to 40 of about 8,430 (314)
Generalizing the Discrete Timed Automaton [PDF]
, 2001 We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with various data structures. We give examples of such data structures and exhibit some new properties of discrete timed automata that can be verified.
Oscar H. Ibarra, Jianwen Su
openaire +1 more source
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
Model Checking for Real-Time Attack Detection in Water Distribution Systems
Информатика и автоматизация, 2022 Water distribution systems represents critical infrastructures. These architectures are really critical and an irregular behaviour can be reflected in human safety. As a matter of fact, an attacker obtaining the control of such of an architecture is able
Francesco Mercaldo +2 more
doaj +1 more source
Coarse abstractions make Zeno behaviours difficult to detect [PDF]
Logical Methods in Computer Science, 2013 An infinite run of a timed automaton is Zeno if it spans only a finite amount of time. Such runs are considered unfeasible and hence it is important to detect them, or dually, find runs that are non-Zeno.
Frédéric Herbreteau, B Srivathsan
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
Population Based Methods for Optimising Infinite Behaviours of Timed Automata [PDF]
, 2018 Timed automata are powerful models for the analysis of real time systems. The optimal infinite scheduling problem for double-priced timed automata is concerned with finding infinite runs of a system whose long term cost to reward ratio is minimal. Due to
French, Tim +2 more
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
Compact and tractable automaton-based representations of time granularities
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DAL LAGO U +2 more
openaire +4 more sources
On the Designing of Model Checkers for Real-Time Distributed Systems
Моделирование и анализ информационных систем, 2015 To verify real-time properties of UML statecharts one may apply a UPPAAL, toolbox for model checking of real-time systems. One of the most suitable ways to specify an operational semantics of UML statecharts is to invoke the formal model of Hierarchical ...
D. Yu. Volkanov +4 more
doaj +1 more source
The Complexity of Codiagnosability for Discrete Event and Timed Systems [PDF]
, 2010 In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA).
D. Kozen +16 more
core +3 more sources