English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Larsen and Skou characterized probabilistic bisimilarity over reactiveprobabilistic systems with a logic including true, negation, conjunction, and adiamond modality decorated with a probabilistic lower bound. Later on,Desharnais, Edalat, and Panangaden showed that negation is not necessary tocharacterize the same equivalence. In this paper, we prove that the logicalcharacterization holds also when conjunction is replaced by disjunction, withnegation still being not necessary. To this end, we introduce reactiveprobabilistic trees, a fully abstract model for reactive probabilistic systemsthat allows us to demonstrate expressiveness of the disjunctive probabilisticmodal logic, as well as of the previously mentioned logics, by means of acompactness argument.

Disjunctive Probabilistic Modal Logic is Enough for Bisimilarity on Reactive Probabilistic Systems