Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,992,859 papers from all fields of science
Search
Sign In
Create Free Account
Probabilistic bisimulation
In theoretical computer science, probabilistic bisimulation is an extension of the concept of bisimulation for fully probabilistic transition systems…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Bisimulation
Theoretical computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A framework for automatically checking anonymity with CRL Chothia
Tom Chothia
,
S. Orzan
,
J. Pang
,
Mohammad Dashti
2017
Corpus ID: 260452697
We present a powerful and flexible method for automatically checking anonymity in a possibilistic general-purpose process…
Expand
2016
2016
Compositional Reasoning for Interval Markov Decision Processes
V. Hashemi
,
H. Hermanns
,
Andrea Turrini
arXiv.org
2016
Corpus ID: 12611743
Model checking probabilistic CTL properties of Markov decision processes with convex uncertainties has been recently investigated…
Expand
2015
2015
EPTCS 180 Proceedings of the Tenth Workshop on Model Based Testing
Bernd-Holger Schlingloff
2015
Corpus ID: 26646579
2015
2015
Mobility between Europe and Argentina applying Logics to Systems Project Acronym : MEALS Deliverable no . : 1 . 3 / 2 Title of Deliverable : Probabilistic Bisimulation for Realistic Schedulers
H. Hermanns
,
Lei Song
,
Lijun Zhang
2015
Corpus ID: 9811051
Weak distribution bisimilarity is an equivalence notion on probabilistic automata, originally proposed for Markov automata. It…
Expand
2010
2010
Symbolic reductions of probabilistic models using linear process equations
Mark Timmer
2010
Corpus ID: 124703840
2006
2006
A compositional merge of probabilistic processes in the alternating model
S. Andova
,
J. Baeten
,
P. D’Argenio
,
T. Willemse
2006
Corpus ID: 15101278
We investigate concurrency of probabilistic systems in the alternating model. So far two different merge operators that capture…
Expand
2001
2001
Designing the Minimal Structure of Hidden Markov Model by Bisimulation
M. Bicego
,
A. Dovier
,
Vittorio Murino
Energy Minimization Methods in Computer Vision…
2001
Corpus ID: 8933277
Hidden Markov Models (HMMs) are an useful and widely utilized approach to the modeling of data sequences. One of the problems…
Expand
1999
1999
Taking chances on MERGE and FAIL: Extending strong and probabilistic bisimulation
J. den Hartog
,
E. D. de Vink
1999
Corpus ID: 118109996
For a process language, featuring nondeterministic and probabilistic choice, a parallel operator and a failure construct, a…
Expand
1999
1999
On Generative Parallel Composition 1
P. D’Argenio
,
H. Hermanns
,
J. Katoen
1999
Corpus ID: 14821898
A major reason for studying probabilistic processes is to establish a link between a formal model for describing functional…
Expand
1998
1998
METRIC SEMANTICS FOR REACTIVE PROBABILISTIC PROCESSES
G. Norman
1998
Corpus ID: 115554560
In this thesis we present three mathematical frameworks for the modelling of reactive probabilistic communicating processes. We…
Expand