Sciweavers

55 search results - page 5 / 11
» Pomset Languages of Finite Step Transition Systems
Sort
View
DSRT
2008
IEEE
14 years 1 months ago
Modeling System Security Rules with Time Constraints Using Timed Extended Finite State Machines
Security and reliability are of paramount importance in designing and building real-time systems because any security failure can put the public and the environment at risk. In th...
Wissam Mallouli, Amel Mammar, Ana R. Cavalli
ASM
2004
ASM
14 years 27 days ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
CDC
2010
IEEE
129views Control Systems» more  CDC 2010»
13 years 2 months ago
A symbolic approach to controlling piecewise affine systems
Abstract-- We present a computational framework for automatic synthesis of a feedback control strategy for a piecewise affine (PWA) system from a specification given as a Linear Te...
Jana Tumova, Boyan Yordanov, Calin Belta, Ivana Ce...
HCI
2009
13 years 5 months ago
Using Graphical Models for an Intelligent Mixed-Initiative Dialog Management System
The main goal of dialog management is to provide all information needed to perform e. g. a SQL-query, a navigation task, etc. Two principal approaches for dialog management systems...
Stefan Schwärzler, Günther Ruske, Frank ...
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper