391 search results - page 43 / 79 » Compositionality for Probabilistic Automata |
110
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...
101
click to vote
RP
2010
Springer
15 years 1 months ago
2010
Springer
We aim at finding a set of timing parameters for which a given timed automaton has a “good” behavior. We present here a novel approach based on the decomposition of the parame...
117
click to vote
JCST
2008
15 years 2 months ago
2008
Transformational approaches to generating design and implementation models from requirements can bring effectiveness and quality to software development. In this paper we present a...
139
click to vote
FORTE
2009
15 years 11 days ago
2009
Abstract. Service compositions leverage remote services to deliver addedvalue distributed applications. Since services are administered and run by independent parties, the governan...
134
click to vote
JCSS
2008
15 years 2 months ago
2008
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...