Sciweavers

512 search results - page 28 / 103
» Automata as Abstractions
Sort
View
CADE
2009
Springer
14 years 9 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
BIRTHDAY
2008
Springer
13 years 10 months ago
History Dependent Automata for Service Compatibility
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...
Vincenzo Ciancia, Gian Luigi Ferrari, Marco Pistor...
FORMATS
2007
Springer
14 years 15 days ago
Partial Order Reduction for Verification of Real-Time Components
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
John Håkansson, Paul Pettersson
COORDINATION
2009
Springer
13 years 12 months ago
From Coordination to Stochastic Models of QoS
Abstract. Reo is a channel-based coordination model whose operational semantics is given by Constraint Automata (CA). Quantitative Constraint Automata extend CA (and hence, Reo) wi...
Farhad Arbab, Tom Chothia, Rob van der Mei, Sun Me...
KI
2008
Springer
13 years 8 months ago
Translating Cooperative Strategies for Robot Behavior
Abstract. This paper presents a method for engineering and programming multirobot systems, based on a combination of statecharts and hybrid automata, which are well-known in the fi...
Florian Ruh, Frieder Stolzenburg