Sciweavers

503 search results - page 19 / 101
» Probabilistic Weighted Automata
Sort
View
BIRTHDAY
2005
Springer
14 years 2 months ago
Compositional Reasoning for Probabilistic Finite-State Behaviors
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...
Yuxin Deng, Catuscia Palamidessi, Jun Pang
FSTTCS
2010
Springer
13 years 6 months ago
Generalizing the powerset construction, coalgebraically
a is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behav...
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsa...
ICTAC
2004
Springer
14 years 2 months ago
Switched Probabilistic I/O Automata
A switched probabilistic I/O automaton is a special kind of probabilistic I/O automaton (PIOA), enriched with an explicit mechanism to exchange control with its environment. Every ...
Ling Cheung, Nancy A. Lynch, Roberto Segala, Frits...
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 8 months ago
Quantitative Games on Probabilistic Timed Automata
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Triv...
CSFW
2007
IEEE
14 years 3 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini