391 search results - page 37 / 79 » Compositionality for Probabilistic Automata |
ECAL
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Self-replicating structures in cellular automata have been extensively studied in the past as models of Artificial Life. However, CAs, unlike the biological cellular mod...
CONCUR
2001
Springer
14 years 1 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
CAV
2006
Springer
14 years 12 days ago
2006
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, litt...
ICALP
2011
Springer
13 years 3 days ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...