Logical characterization of branching metrics for nondeterministic probabilistic transition systems
DOI10.1016/J.IC.2019.06.001zbMATH Open1430.68161OpenAlexW2949241705WikidataQ127701802 ScholiaQ127701802MaRDI QIDQ2272986FDOQ2272986
Simone Tini, Valentina Castiglioni
Publication date: 17 September 2019
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2019.06.001
Recommendations
- Behavioural pseudometrics for nondeterministic probabilistic systems
- Characterising probabilistic processes logically (extended abstract)
- Automata, Languages and Programming
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
- Logical characterizations of behavioral relations on transition systems of probability distributions
logical characterizationmetric semanticsnondeterministic probabilistic transition systemsbranching metrics
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Bisimulation for labelled Markov processes
- A lattice-theoretical fixpoint theorem and its applications
- Algebraic laws for nondeterminism and concurrency
- Bisimulation through probabilistic testing
- Chain-complete posets and directed sets with applications
- A logic for reasoning about time and reliability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Metrics for labelled Markov processes
- Taking It to the Limit: Approximate Reasoning for Markov Processes
- Title not available (Why is that?)
- Continuous Markovian Logics - Axiomatization and Quantified Metatheory
- Results on the propositional \(\mu\)-calculus
- Formal verification of parallel programs
- A behavioural pseudometric for probabilistic transition systems
- Exploring probabilistic bisimulations. I
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
- Game Refinement Relations and Metrics
- Title not available (Why is that?)
- Probabilistic logical characterization
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
- Bisimulations for non-deterministic labelled Markov processes
- CONCUR 2003 - Concurrency Theory
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
- On behavioural pseudometrics and closure ordinals
- Observing branching structure through probabilistic contexts
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Characterising Probabilistic Processes Logically
- Weak bisimulation metrics in models with nondeterminism and continuous state spaces
- SOS specifications for uniformly continuous operators
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- Generalized Bisimulation Metrics
- Title not available (Why is that?)
- Compositional weak metrics for group key update
- Probabilistic bisimulation as a congruence
- Foundations of Security Analysis and Design II
- A modal characterization of observational congruence on finite terms of CCS
- Characteristic formulae for processes with divergence
- Distribution-based bisimulation for labelled Markov processes
- A general SOS theory for the specification of probabilistic transition systems
- Converging from Branching to Linear Metrics on Markov Chains
- Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics
- Compositional Metric Reasoning with Probabilistic Process Calculi
- Linear Distances between Markov Chains
- Modal Decomposition on Nondeterministic Probabilistic Processes
- SOS specifications of probabilistic systems by uniformly continuous operators
- Characteristic formulae for fixed-point semantics: a general framework
- Title not available (Why is that?)
- Title not available (Why is that?)
- A General Framework for Probabilistic Characterizing Formulae
- Title not available (Why is that?)
Cited In (8)
- Probabilistic divide \& congruence: branching bisimilarity
- Title not available (Why is that?)
- Automata, Languages and Programming
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
- SOS specifications for uniformly continuous operators
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- Computing bisimilarity metrics for probabilistic timed automata
This page was built for publication: Logical characterization of branching metrics for nondeterministic probabilistic transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272986)
