85 search results - page 1 / 17 » State-transition machines, revisited |
APSEC
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper presents an idea to apply Jackson’s JSP method, which is suitable for the transformation problem frame, into the state transition design, presented in the behavior pr...
CONCUR
2000
Springer
13 years 8 months ago
2000
Springer
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...
CSCLP
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
ICML
2005
IEEE
14 years 6 months ago
2005
IEEE
We present a new subgoal-based method for automatically creating useful skills in reinforcement learning. Our method identifies subgoals by partitioning local state transition gra...
APSEC
2007
IEEE
13 years 11 months ago
2007
IEEE
E-AoSAS++ is an aspect-oriented software architecture style for embedded software. It basically gives the style in which a set of state transition machines organizes a software. W...