Sciweavers

1246 search results - page 23 / 250
» Recursive Timed Automata
Sort
View
FMSD
2006
140views more  FMSD 2006»
13 years 7 months ago
Dealing with practical limitations of distributed timed model checking for timed automata
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
Víctor A. Braberman, Alfredo Olivero, Ferna...
FORMATS
2009
Springer
14 years 2 months ago
On the Supports of Recognizable Timed Series
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...
Karin Quaas
RTSS
1999
IEEE
13 years 11 months ago
Specification and Analysis of Soft Real-Time Systems: Quantity and Quality
This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arb...
Pedro R. D'Argenio, Joost-Pieter Katoen, Ed Brinks...
WIA
2009
Springer
13 years 12 months ago
On Extremal Cases of Hopcroft's Algorithm
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
Giusi Castiglione, Antonio Restivo, Marinella Scio...
IANDC
2007
107views more  IANDC 2007»
13 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...