Sciweavers

2632 search results - page 13 / 527
» Alternating Timed Automata
Sort
View
FCT
1999
Springer
15 years 1 months ago
Iterative Arrays with a Wee Bit Alternation
Abstract. An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fe...
Thomas Buchholz, Andreas Klein, Martin Kutrib
ASE
2002
160views more  ASE 2002»
14 years 9 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
ENTCS
2006
96views more  ENTCS 2006»
14 years 9 months ago
Weighted Timed Automata: Model-Checking and Games
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model. Key words: Weighted/pri...
Patricia Bouyer
FOSSACS
2009
Springer
15 years 4 months ago
Interrupt Timed Automata
Abstract. 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 proc...
Béatrice Bérard, Serge Haddad
FUIN
2008
92views more  FUIN 2008»
14 years 9 months ago
Translation of Timed Promela to Timed Automata with Discrete Data
The aim of the work is twofold. In order to face the problem of modeling time constraints in Promela, a timed extension of the language is presented. Next, timed Promela is transla...
Wojciech Nabialek, Agata Janowska, Pawel Janowski