391 search results - page 61 / 79 » Compositionality for Probabilistic Automata |
DC
2007
13 years 7 months ago
2007
We present a randomizedself-stabilizing leaderelection protocol and a randomizedself-stabilizing token circulation protocol under an arbitrary scheduler on anonymous and unidirect...
TVLSI
2008
13 years 7 months ago
2008
ion levels. The framework also supports the generation of test constraints, which can be satisfied using a constraint solver to generate tests. A compositional verification approac...
IJFCS
2007
13 years 7 months ago
2007
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
RTSS
2008
IEEE
14 years 1 months ago
2008
IEEE
The Real-Time Calculus (RTC) framework proposed in [Chakraborty et al., DATE 2003] and subsequently extended in [Wandeler et al., Real-Time Systems 29(2-3), 2005] and a number of ...
ATVA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we describe a decompositional approach to convergence proofs for stochastic hybrid systems given as probabilistic hybrid automata. We focus on a concept called “st...