Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations
From MaRDI portal
Publication:2830042
DOI10.1007/978-3-319-05119-2_18zbMath1348.68156OpenAlexW1447540840WikidataQ124439016 ScholiaQ124439016MaRDI QIDQ2830042
Michele Loreti, Rocco De Nicola, Marco Bernardo
Publication date: 9 November 2016
Published in: Trustworthy Global Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-05119-2_18
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Relating strong behavioral equivalences for processes with nondeterminism and probabilities ⋮ Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
Cites Work
- Unnamed Item
- Unnamed Item
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Probabilistic logical characterization
- Characterizing finite Kripke structures in propositional temporal logic
- Bisimulation through probabilistic testing
- Probabilistic models for the guarded command language
- Reactive, generative, and stratified models of probabilistic processes
- Exploring probabilistic bisimulations. I
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
- Bisimulation for labelled Markov processes
- Finite state Markovian decision processes
- Model checking of probabilistic and nondeterministic systems
- Bisimulations Meet PCTL Equivalences for Probabilistic Automata
- A Spectrum of Behavioral Relations over LTSs on Probability Distributions
- Game Refinement Relations and Metrics
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Algebraic laws for nondeterminism and concurrency
- Formal verification of parallel programs
- Validation of Stochastic Systems
- Probabilistic automata
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems