Upper-Expectation Bisimilarity and Łukasiewicz μ -Calculus
作者： Matteo Mio
DOI: 10.1007/978-3-642-54830-7_22
关键词:
摘要: Several notions of bisimulation relations for probabilistic nondeterministic transition systems have been considered in the literature. We study a novel testing-based behavioral equivalence called upper expectation bisimilarity and, using standard results from functional analysis, we develop its coalgebraic and algebraic theory provide logical characterization terms an expressive modal μ-calculus.
springer.com
archives-ouvertes.fr
sci-hub.st 参考文章(38)
Roberto Segala, Nancy Lynch, Probabilistic simulations for probabilistic processes Nordic Journal of Computing. ,vol. 2, pp. 250- 273 ,(1995)
Pedro R. D’Argenio, Daniel Gebler, Matias David Lee, Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules foundations of software science and computation structure. pp. 289- 303 ,(2014) , 10.1007/978-3-642-54830-7_19
Gianluigi Zavattaro, Mario Bravetti, Concur 2009 - Concurrency Theory ,(2009)
Silvia Crafa, Francesco Ranzato, A Spectrum of Behavioral Relations over LTSs on Probability Distributions CONCUR 2011 – Concurrency Theory. pp. 124- 139 ,(2011) , 10.1007/978-3-642-23217-6_9
Kousha Etessami, A Hierarchy of Polynomial-Time Computable Simulations for Automata CONCUR 2002 — Concurrency Theory. pp. 131- 144 ,(2002) , 10.1007/3-540-45694-5_10
M. Huth, M. Kwiatkowska, Quantitative analysis and model checking logic in computer science. pp. 111- 122 ,(1997) , 10.1109/LICS.1997.614940
Joost-Pieter Katoen, Christel Baier, Principles of Model Checking ,(2008)
Alexander S. Kechris, Classical descriptive set theory ,(1987)
Yuxin Deng, Rob van Glabbeek, Characterising probabilistic processes logically international conference on logic programming. ,vol. 6397, pp. 278- 293 ,(2010) , 10.1007/978-3-642-16242-8_20
Prakash Panangaden, Labelled Markov Processes ,(2009)