VMCAI
2012
Springer
12 years 2 days ago
2012
Springer
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...
CONCUR
2011
Springer
12 years 4 months ago
2011
Springer
Probabilistic nondeterministic processes are commonly modeled as probabilistic LTSs (PLTSs, a.k.a. probabilistic automata). A number of logical characterizations of the main behavi...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...
IJFCS
2008
13 years 4 months ago
2008
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
CONCUR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
CONCUR
2006
Springer
13 years 8 months ago
2006
Springer
We give a brief overview of operational models for concurrent systems that exhibit probabilistic behavior, focussing on the interplay between probability and nondeterminism. Our su...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
CONCUR
2003
Springer
13 years 9 months ago
2003
Springer
We establish that on the domain of probabilistic automata, the trace distribution precongruence coincides with the simulation preorder.
VOSS
2004
Springer
13 years 10 months ago
2004
Springer
We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in an expressiveness hierarchy of probabilistic system types. The aim of this paper...