8 search results - page 2 / 2 » Probabilistic Automata: System Types, Parallel Composition a... |
FOSSACS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We study the interaction between non-deterministic and probabilistic behaviour in systems with continuous state spaces, arbitrary probability distributions and uncountabl...
CORR
2011
Springer
13 years 10 days ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
QEST
2010
IEEE
13 years 3 months ago
2010
IEEE
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...