Sciweavers

163 search results - page 21 / 33
» An Introduction to Probabilistic Automata
Sort
View
FOSSACS
2003
Springer
14 years 27 days ago
Model Checking Lossy Channels Systems Is Probably Decidable
Lossy channel systems (LCS’s) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these syste...
Nathalie Bertrand, Ph. Schnoebelen
ECAL
2001
Springer
14 years 6 days ago
Fault-Tolerant Structures: Towards Robust Self-Replication in a Probabilistic Environment
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...
Daniel C. Bünzli, Mathieu S. Capcarrèr...
CONCUR
2001
Springer
14 years 6 days ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
ICALP
2005
Springer
14 years 1 months ago
Weighted Automata and Weighted Logics
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
Manfred Droste, Paul Gastin
ICALP
2011
Springer
12 years 11 months ago
On the Semantics of Markov Automata
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 ...
Yuxin Deng, Matthew Hennessy