233 search results - page 9 / 47 » Equivalent Transformations of Automata by Using Behavioural ... |
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
PACT
2005
Springer
14 years 1 months ago
2005
Springer
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
Autonomics or self-reorganization becomes pertinent for websites serving a large number of users with highly varying workloads. An important component of self-adaptation is to mod...
EPEW
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we show how we can translate Web Services described by WS-CDL into a timed automata orchestration, and more specifically we are interested in Web services with time ...