[HTML][HTML] Probabilistic weak bisimulation and axiomatization for probabilistic models
H Wu, H Long - Information Processing Letters, 2023 - Elsevier
Recently a branching bisimilarity congruence has been established for randomized process
models in a model independent approach. In this paper, we propose a probabilistic weak …
models in a model independent approach. In this paper, we propose a probabilistic weak …
Explicit identifiers and contexts in reversible concurrent calculus
Existing formalisms for the algebraic specification and representation of networks of
reversible agents suffer some shortcomings. Despite multiple attempts, reversible …
reversible agents suffer some shortcomings. Despite multiple attempts, reversible …
An axiomatization of strong distribution bisimulation for a language with a parallel operator and probabilistic choice
JF Groote, EP de Vink - From Software Engineering to Formal Methods …, 2019 - Springer
In the setting of a simple process language featuring non-deterministic choice and a parallel
operator on the one hand and probabilistic choice on the other hand, we propose an …
operator on the one hand and probabilistic choice on the other hand, we propose an …
Algorithms for sparse convolution and sublinear edit distance
N Fischer - 2023 - publikationen.sulb.uni-saarland.de
In this PhD thesis on fine-grained algorithm design and complexity, we investigate output-
sensitive and sublinear-time algorithms for two important problems.(1) Sparse Convolution …
sensitive and sublinear-time algorithms for two important problems.(1) Sparse Convolution …
On the probabilistic bisimulation spectrum with silent moves
In this paper we look at one of the seminal works of Rob van Glabbeek from a probabilistic
angle. We develop the bisimulation spectrum with silent moves for probabilistic models …
angle. We develop the bisimulation spectrum with silent moves for probabilistic models …
A complete axiomatization of branching bisimilarity for a simple process language with probabilistic choice
This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic
processes. In order to characterize the corresponding notion of rooted branching …
processes. In order to characterize the corresponding notion of rooted branching …
Preface to the special issue on Open Problems in Concurrency Theory
I Castellani, PR D'Argenio, MR Mousavi… - Journal of Logical and …, 2023 - Elsevier
Preface to the special issue on Open Problems in Concurrency Theory - ScienceDirect Skip
to main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View …
to main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View …
On Probabilistic Weak Bisimilarity
H Wu, H Long - Available at SSRN 4201825 - papers.ssrn.com
Recently a branching bisimilarity congruence has been established for randomized process
models in a model independent approach. In this paper, we propose a new probabilistic …
models in a model independent approach. In this paper, we propose a new probabilistic …
[PDF][PDF] Journal of Logical and Algebraic Methods in Programming
The research seminar Open Problems in Concurrency Theory (OPCT 2017) took place in
the Institute of Science and Technology Austria (IST Austria), from the 26th to the 29th of …
the Institute of Science and Technology Austria (IST Austria), from the 26th to the 29th of …