Sciweavers

3169 search results - page 4 / 634
» Robust Timed Automata
Sort
View
HYBRID
2000
Springer
13 years 11 months ago
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
Joseph S. Miller
CONCUR
2009
Springer
14 years 2 months ago
Concavely-Priced Probabilistic Timed Automata
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...
Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin No...
IPPS
2005
IEEE
14 years 1 months ago
Production Scheduling by Reachability Analysis - A Case Study
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
Gerd Behrmann, Ed Brinksma, Martijn Hendriks, Ange...
AGENTCL
2000
Springer
13 years 11 months ago
Constructing Robust Conversation Policies in Dynamic Agent Communities
Conversation policies codify the allowable exchanges of speech acts among agents as they execute specific types of tasks. Both the set of agents in a community, and the nature of...
Marian H. Nodine, Amy Unruh
TSE
2008
97views more  TSE 2008»
13 years 7 months ago
Timed Automata Patterns
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variabl...
Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun 00...