Bisimulations Meet PCTL Equivalences for Probabilistic Automata
From MaRDI portal
Publication:5299841
DOI10.2168/LMCS-9(2:7)2013zbMath1264.03087WikidataQ51540612 ScholiaQ51540612MaRDI QIDQ5299841
Jens Chr. Godskesen, Lei Song, Flemming Nielson, Li-jun Zhang
Publication date: 24 June 2013
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
characterizationbisimulationprobabilistic automatabehavioral equivalencePCTLprobabilistic computation tree logic
Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Modeling and analysis of the obstacle-avoidance strategies for a mobile robot in a dynamic environment ⋮ On the probabilistic bisimulation spectrum with silent moves ⋮ \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics ⋮ Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ Towards general axiomatizations for bisimilarity and trace semantics ⋮ Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes ⋮ Bisimulations Meet PCTL Equivalences for Probabilistic Automata
