Sciweavers

391 search results - page 20 / 79
» Compositionality for Probabilistic Automata
Sort
View
87
Voted
CONCUR
2006
Springer
15 years 1 months ago
Probabilistic I/O Automata: Theories of Two Equivalences
Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatizatio...
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
78
Voted
ALT
2005
Springer
15 years 6 months ago
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
Nick Palmer, Paul W. Goldberg
LMCS
2006
87views more  LMCS 2006»
14 years 9 months ago
Model Checking Probabilistic Pushdown Automata
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...
Antonín Kucera, Javier Esparza, Richard May...
79
Voted
QEST
2008
IEEE
15 years 3 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
WSS
2001
111views Control Systems» more  WSS 2001»
14 years 11 months ago
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
Abstract. We study a special type of self-stabilizing algorithms composition : the cross-over composition (A B). The cross-over composition is the generalization of the algorithm c...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...