Journal ArticleDOI
Raiders of the lost equivalence: Probabilistic branching bisimilarity
Reads0
Chats0
TLDR
The probabilistic analogue to the notion of semi-branching bisimilarity and to van Glabbeek and Weijland's Stuttering Lemma are introduced to prove that Probabilistic branching bis similarity is indeed an equivalence relation.About:
This article is published in Information Processing Letters.The article was published on 2020-07-01. It has received 5 citations till now. The article focuses on the topics: Nondeterministic algorithm & Probabilistic logic.read more
Citations
More filters
Journal Article
Branching Bisimulation for Probabilistic Systems: Characteristics and Decidability
Suzana Andova,Tim A. C. Willemse +1 more
TL;DR: The concept of abstraction in the setting of probabilistic reactive systems, and its formal underpinnings for the strictly alternating model of Hansson, are addressed, and it is shown that branching bisimilarity in the latter setting turns out to discriminate between systems that are intuitively branch bisimilar.
Proceedings ArticleDOI
In search of lost time: axiomatising parallel composition in process algebras
TL;DR: In this article, the authors present a survey of the most recent achievements in the axiomatisation of parallel composition modulo bisimiliarity, focusing on the recursion, relabelling and restriction free fragment of CCS.
Journal ArticleDOI
Model independent approach to probabilistic models
TL;DR: A uniform approach to probabilistic process models and a bisimulation theory for Probabilistic concurrency are proposed.
Journal ArticleDOI
A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
Ruggero Lanotte,Simone Tini +1 more
TL;DR: It is proven that the weak bisimulation metric is non-expansive, thus allowing for compositional reasoning and it is proved that systems at distance zero are equated by a suitable notion of probabilistic weak bisIMulation.
Journal ArticleDOI
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
TL;DR: In this article , it was shown that an auxiliary binary operator facilitating a finite axiomatisation of bisimilarity in the simplified setting cannot satisfy all three natural assumptions pertaining to the operational semantics of auxiliary operators and their relationship to parallel composition.
References
More filters
Book
A calculus of communicating systems
TL;DR: A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0.
Book ChapterDOI
Concurrency and Automata on Infinite Sequences
TL;DR: A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.
Journal ArticleDOI
A logic for reasoning about time and reability
Hans Hansson,Bengt Jonsson +1 more
TL;DR: This work presents a logic for stating properties such as, “after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds” and gives algorithms for checking that a given Markov chain satisfies a formula in the logic.
Book ChapterDOI
The Linear Time - Branching Time Spectrum II
TL;DR: In this paper, semantic equivalences and preorders for sequential systems with silent moves are studied, focusing on the ones that abstract from successful termination, stochastic and real-time aspects of the investigated systems, and the structure of the visible actions systems can perform.
Journal ArticleDOI
Branching time and abstraction in bisimulation semantics
TL;DR: This paper investigates whether observation equivalence really does respect the branching structure of processes, and finds that in the presence of the unobservable action τ of CCS this is not the case, and the notion of branching bisimulation equivalence is introduced which strongly preserves the branching structures of processes.
Related Papers (5)
Branching Bisimulation for Probabilistic Systems: Characteristics and Decidability
Suzana Andova,Tim A. C. Willemse +1 more