A general framework for probabilistic characterizing formulae

DOI10.1007/978-3-642-27940-9_26MaRDI QIDQ2891432zbMATH OpenOpenAlexFDO

Authors Joshua Sack, Lijun Zhang

Publication date 15 June 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-27940-9_26

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Characterising probabilistic processes logically (extended abstract)
• Characteristic formulae for fixed-point semantics: a general framework
• Characteristic formulae for fixed-point semantics: a general framework
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
• Probabilistic logical characterization

Cites work

• A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
• A lattice-theoretical fixpoint theorem and its applications
• Characterising probabilistic processes logically (extended abstract)
• Characteristic formulae for fixed-point semantics: a general framework
• Deciding bisimilarity and similarity for probabilistic processes.
• Finite models constructed from canonical formulas
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
• Model checking of probabilistic and nondeterministic systems
• On the use of MTBDDs for performability analysis and verification of stochastic systems.
• Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
• Probabilistic extensions of process algebras.
• Probabilistic logical characterization
• The Max-Flow Min-Cut theorem for countable networks
• Weak bisimulation is sound and complete for pCTL\(^*\)

Cited in

(13)

• A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
• CryptHOL: game-based proofs in higher-order logic
• Logical characterization of branching metrics for nondeterministic probabilistic transition systems
• Probabilistic functions and cryptographic oracles in higher order logic
• Characteristic formulae for fixed-point semantics: a general framework
• Computing Behavioral Relations for Probabilistic Concurrent Systems
• scientific article; zbMATH DE number 1765693 (Why is no real title available?)
• Characterising probabilistic processes logically (extended abstract)
• Bisimulations for probabilistic and quantum processes (invited paper)
• Characteristic formulae for fixed-point semantics: a general framework
• Characteristic formulae for relations with nested fixed points
• Explainability of probabilistic bisimilarity distances for labelled Markov chains
• Logical characterization of bisimulation metrics

This page was built for publication: A general framework for probabilistic characterizing formulae

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891432)