Logical characterization of branching bisimilarity over random processes
From MaRDI portal
Cites work
- A characterisation of open bisimilarity using an intuitionistic modal logic
- A lattice-theoretical fixpoint theorem and its applications
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems
- Algebraic laws for nondeterminism and concurrency
- Bisimulation through probabilistic testing
- Branching bisimulation congruence for probabilistic systems
- Characterising probabilistic processes logically (extended abstract)
- Characterising Testing Preorders for Finite Probabilistic Processes
- Characteristic formulae for processes with divergence
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1512615 (Why is no real title available?)
- scientific article; zbMATH DE number 1759621 (Why is no real title available?)
- scientific article; zbMATH DE number 7280017 (Why is no real title available?)
- Logical characterization of bisimulation for transition relations over probability distributions with internal actions
- Logical characterization of bisimulation metrics
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Modal logics for mobile processes
- Modal logics for mobile processes revisited
- Model checking of probabilistic and nondeterministic systems
- Model independent approach to probabilistic models
- Precongruence formats for decorated trace semantics
- Probabilistic and prioritized models of timed CSP
- Probabilistic divide \& congruence: branching bisimilarity
- Quasi-open bisimilarity with mismatch is intuitionistic
- Reactive Systems
- Reactive, generative, and stratified models of probabilistic processes
- SOS-based modal decomposition on nondeterministic probabilistic processes
- The -calculus: A theory of mobile processes
- Three logics for branching bisimulation
This page was built for publication: Logical characterization of branching bisimilarity over random processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912019)