Sciweavers

346 search results - page 40 / 70
» Determinizing Asynchronous Automata
Sort
View
PACT
2007
Springer
15 years 4 months ago
Orthogonal Organized Finite State Machine Application to Sensor Acquired Information
The application of the Orthogonal Organized Finite State Machine (OOFSM) to the representation of data acquired by sensor networks is proposed. The OOFSM was proposed in earlier wo...
Brian J. d'Auriol, John Kim, Sungyoung Lee, Young-...
ISCAS
1999
IEEE
72views Hardware» more  ISCAS 1999»
15 years 2 months ago
Shape-based sequential machine analysis
In this paper, the problem of determining if a given sequential specification can be made to fit a predetermined set of shape constraints is explored. Shape constraints are constr...
A. Crews, F. Brewer
AROBOTS
2000
108views more  AROBOTS 2000»
14 years 10 months ago
Optimal Selection of Uncertain Actions by Maximizing Expected Utility
A new means of action selection via utility fusion is introduced as an alternative to both sensor fusion and command fusion. Distributed asynchronous behaviors indicate the utility...
Julio Rosenblatt
SIAMCOMP
2010
105views more  SIAMCOMP 2010»
14 years 4 months ago
Fast Access to Distributed Atomic Memory
We study efficient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as...
Partha Dutta, Rachid Guerraoui, Ron R. Levy, Marko...
SEFM
2009
IEEE
15 years 4 months ago
Specifying Interacting Components with Coordinated Concurrent Scenarios
Abstract. We introduce a visual notation for local specification of concurrent components based on message sequence charts (MSCs). Each component is a finite-state machine whose ...
Prakash Chandrasekaran, Madhavan Mukund