Probabilistic transition system specifications (PTSS) provide structural operational semantics for reactive probabilistic labeled transition systems. Bisimulation equivalences and bisimulation metrics are fundamental notions to describe behavioral relations and distances of states, respectively. We provide a method to generate from a PTSS a sound and ground-complete equational axiomatization for strong and convex bisimilarity. The construction is based on the method of Aceto, Bloom and Vaandrager developed for non-deterministic transition system specifications. The novelty in our approach is to employ many-sorted algebras to axiomatize separately non-deterministic choice, probabilistic choice and their interaction. Furthermore, we generaliz...
AbstractIn this paper, we consider the behavioral pseudometrics for probabilistic systems, which are...
AbstractDiscrete notions of behavioural equivalence sit uneasily with semantic models featuring quan...
We provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition sys...
Probabilistic transition system specifications (PTSSs) in the ntμfθ=ntμxθ format provide structural ...
This article focuses on the formalization of the structured operational semantics approach for langu...
Probabilistic transition system specifications using the rule format ntµfθ/ntµxθ provide structural ...
AbstractThis paper defines action-labelled quantitative transition systems as a general framework fo...
Abstractϵ-bisimulation equivalence has been proposed in the literature as a technique to study the c...
This paper defines action-labelled quantitative transition systems as a general framework for combin...
Probabilistic automata (PA), also known as probabilistic nondeterministic labelled transition system...
We propose both an SOS transition rule format for the generative model of probabilistic processes, a...
In this paper, we consider the behavioral pseudometrics for probabilistic systems, which are a quant...
This paper denes action-labelled quantitative transition systems as a general frame-work for combini...
Bisimulation metrics are a successful instrument used to estimate the behavioural distance between p...
AbstractIn this paper, we consider the behavioral pseudometrics for probabilistic systems, which are...
AbstractDiscrete notions of behavioural equivalence sit uneasily with semantic models featuring quan...
We provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition sys...
Probabilistic transition system specifications (PTSSs) in the ntμfθ=ntμxθ format provide structural ...
This article focuses on the formalization of the structured operational semantics approach for langu...
Probabilistic transition system specifications using the rule format ntµfθ/ntµxθ provide structural ...
AbstractThis paper defines action-labelled quantitative transition systems as a general framework fo...
Abstractϵ-bisimulation equivalence has been proposed in the literature as a technique to study the c...
This paper defines action-labelled quantitative transition systems as a general framework for combin...
Probabilistic automata (PA), also known as probabilistic nondeterministic labelled transition system...
We propose both an SOS transition rule format for the generative model of probabilistic processes, a...
In this paper, we consider the behavioral pseudometrics for probabilistic systems, which are a quant...
This paper denes action-labelled quantitative transition systems as a general frame-work for combini...
Bisimulation metrics are a successful instrument used to estimate the behavioural distance between p...
AbstractIn this paper, we consider the behavioral pseudometrics for probabilistic systems, which are...
AbstractDiscrete notions of behavioural equivalence sit uneasily with semantic models featuring quan...
We provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition sys...