Sciweavers

369 search results - page 3 / 74
» Canonical finite state machines for distributed systems
Sort
View
CONCUR
2000
Springer
13 years 11 months ago
Reachability Analysis for Some Models of Infinite-State Transition Systems
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
CONCUR
2000
Springer
13 years 12 months ago
Formal Models for Communication-Based Design
Concurrency is an essential element of abstract models for embedded systems. Correctness and e ciency of the design depend critically on the way concurrency is formalized and imple...
Alberto L. Sangiovanni-Vincentelli, Marco Sgroi, L...
DSRT
2008
IEEE
14 years 2 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
DSVIS
2003
Springer
14 years 25 days ago
Applying Extended Finite State Machines in Software Testing of Interactive Systems
Model Based Testing (MBT) is a functional testing technique that makes use of information from behavioral models of the software to carry out the testing task. This technique has b...
Marcelo Fantinato, Mario Jino
PACT
2007
Springer
14 years 1 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-...