Sciweavers

1916 search results - page 91 / 384
» Reconfiguring a state machine
Sort
View
FASE
2005
Springer
14 years 1 months ago
Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars
Modeling the dependencies between provided and required services within a software component is necessary for several reasons, such as automated component adaptation and architectu...
Ralf Reussner, Jens Happe, Annegret Habel
ISSTA
1998
ACM
13 years 11 months ago
Improving Efficiency of Symbolic Model Checking for State-Based System Requirements
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
William Chan, Richard J. Anderson, Paul Beame, Dav...
ATAL
2001
Springer
14 years 12 days ago
Commitment Machines
We develop an approach in which we model communication protocols via commitment machines. Commitment machines supply a content to protocol states and actions in terms of the social...
Pinar Yolum, Munindar P. Singh
DNA
2005
Springer
102views Bioinformatics» more  DNA 2005»
14 years 1 months ago
Chain Reaction Systems Based on Loop Dissociation of DNA
In the field of DNA computing, more and more efforts are made for constructing molecular machines made of DNA that work in vitro or in vivo. States of some of those machines are...
Keiichiro Takahashi, Satsuki Yaegashi, Atsushi Kam...
KBSE
2002
IEEE
14 years 25 days ago
What Makes Finite-State Models More (or Less) Testable?
Finite-state machine (FSM) models are commonly used to represent software with concurrent processes. Established model checking tools can be used to automatically test FSM models,...
David Owen, Tim Menzies, Bojan Cukic