Three logics for branching bisimulation
From MaRDI portal
Recommendations
Cited in
(90)- An efficient simulation algorithm based on abstract interpretation
- A logical characterization of well branching event structures
- Finitary logics for some CCS observational bisimulations
- Branching bisimilarity is an equivalence indeed!
- Two implementation relations and the correctness of communicating replicated processes
- Towards a unified view of bisimulation: A comparative study
- Logics for bisimulation and divergence
- Characterizing right inverses for spatial constraint systems with applications to modal logic
- Branching time and orthogonal bisimulation equivalence
- Probabilistic divide \& congruence: branching bisimilarity
- Compositional verification of concurrent systems by combining bisimulations
- All congruences below stability-preserving fair testing or CFFD
- A complete axiomatization of weighted branching bisimulation
- Cartesian difference categories
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
- Simulation for lattice-valued doubly labeled transition systems
- Next-preserving branching bisimulation
- Operational semantics for Petri net components
- Comparative branching-time semantics for Markov chains
- Universal extensions to simulate specifications
- Branching bisimulation for probabilistic systems: characteristics and decidability
- A general approach to comparing infinite-state systems with their finite-state specifications
- Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal
- Formal verification technique for grid service chain model and its application
- Egalitarian State-Transition Systems
- A logical process calculus
- Characteristic formulae for fixed-point semantics: a general framework
- Folk Theorems on the Correspondence between State-Based and Event-Based Systems
- Partial-Order Reduction
- Abstraction and abstraction refinement
- Deriving inverse operators for modal logic
- Computing Stuttering Simulations
- Branching Bisimilarity with Explicit Divergence
- Model Checking Value-Passing Modal Specifications
- Embedding of biological regulatory networks and property preservation
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- scientific article; zbMATH DE number 3919813 (Why is no real title available?)
- scientific article; zbMATH DE number 177795 (Why is no real title available?)
- Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
- scientific article; zbMATH DE number 1333607 (Why is no real title available?)
- A formal model for service-oriented interactions
- Compositionality in state space verification methods
- scientific article; zbMATH DE number 4119603 (Why is no real title available?)
- Monitoring and recovery for web service applications
- scientific article; zbMATH DE number 7136658 (Why is no real title available?)
- scientific article; zbMATH DE number 7453959 (Why is no real title available?)
- scientific article; zbMATH DE number 7453963 (Why is no real title available?)
- Geometric Model Checking of Continuous Space
- Compositional specification in rewriting logic
- Relating apartness and bisimulation
- An O(m n) algorithm for branching bisimilarity on labelled transition systems
- Sharp congruences adequate with temporal logics combining weak and strong modalities
- Smaller Abstractions for ∀CTL* without Next
- From EU projects to a family of model checkers. From Kandinsky to KandISTI
- An O(m n) algorithm for computing stuttering equivalence and branching bisimulation
- Simulation refinement for concurrency verification
- Dynamic consistency in process algebra: from paradigm to ACP
- Algebraic characterizations of trace and decorated trace equivalences over tree-like structures
- Modelling and analysing variability in product families: model checking of modal transition systems with variability constraints
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
- Partial-order reduction in the weak modal mu-calculus
- Modelling mutual exclusion in a process algebra with time-outs
- An automated quantitative information flow analysis for concurrent programs
- A Spatial Logic for Simplicial Models
- Equivalence checking 40 years after: a review of bisimulation tools
- Apartness and distinguishing formulas in Hennessy-Milner logic
- A state/event-based model-checking approach for the analysis of abstract system properties
- An accessible verification environment for UML models of services
- On bisimilarity for polyhedral models and \texttt{SLCS}
- Studying equivalences of transition systems with algebraic tools
- Translations between modal logics of reactive systems
- Universal axioms for bisimulations
- Positive Hennessy-Milner logic for branching bisimulation
- Logical characterization of branching bisimilarity over random processes
- Modal logic characterizations of forward, reverse, and forward-reverse bisimilarities
- One energy game for the spectrum between branching bisimilarity and weak trace semantics
- Bisimulations and logics for higher-dimensional automata
- Minimal depth distinguishing formulas without until for branching bisimulation
- Encapsulating deontic and branching time specifications
- The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum
- Title not available (Why is no real title available?)
- Game-theoretic simulation checking tool
- Branching bisimulation congruence for probabilistic systems
- Raiders of the lost equivalence: probabilistic branching bisimilarity
- Translating Java for multiple model checkers: The Bandera back-end
- Model independent approach to probabilistic models
- Theory of interaction
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- Automatic verification of distributed systems: the process algebra approach.
This page was built for publication: Three logics for branching bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369871)
