Three logics for branching bisimulation
From MaRDI portal
Publication:4369871
DOI10.1145/201019.201032zbMATH Open0886.68064OpenAlexW2107144615MaRDI QIDQ4369871FDOQ4369871
Authors: Rocco De Nicola, F. Vaandrager 
Publication date: 2 February 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/1370
Recommendations
Cited In (81)
- Universal extensions to simulate specifications
- Probabilistic divide \& congruence: branching bisimilarity
- Simulation for lattice-valued doubly labeled transition systems
- Branching bisimulation congruence for probabilistic systems
- Automatic verification of distributed systems: the process algebra approach.
- Model independent approach to probabilistic models
- Partial-Order Reduction
- A formal model for service-oriented interactions
- Dynamic consistency in process algebra: from paradigm to ACP
- Simulation refinement for concurrency verification
- Computing Stuttering Simulations
- Partial-order reduction in the weak modal mu-calculus
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- Characteristic formulae for fixed-point semantics: a general framework
- Encapsulating deontic and branching time specifications
- A state/event-based model-checking approach for the analysis of abstract system properties
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- Branching bisimilarity is an equivalence indeed!
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
- Sharp congruences adequate with temporal logics combining weak and strong modalities
- Compositionality in state space verification methods
- Branching bisimulation for probabilistic systems: characteristics and decidability
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- Modelling and analysing variability in product families: model checking of modal transition systems with variability constraints
- Logics for bisimulation and divergence
- Operational semantics for Petri net components
- An accessible verification environment for UML models of services
- Title not available (Why is that?)
- An efficient simulation algorithm based on abstract interpretation
- Characterizing right inverses for spatial constraint systems with applications to modal logic
- Towards a unified view of bisimulation: A comparative study
- Deriving inverse operators for modal logic
- Formal verification technique for grid service chain model and its application
- Game-theoretic simulation checking tool
- Branching Bisimilarity with Explicit Divergence
- Universal axioms for bisimulations
- Monitoring and recovery for web service applications
- Title not available (Why is that?)
- A logical characterization of well branching event structures
- Raiders of the lost equivalence: probabilistic branching bisimilarity
- Embedding of biological regulatory networks and property preservation
- A complete axiomatization of weighted branching bisimulation
- All congruences below stability-preserving fair testing or CFFD
- Comparative branching-time semantics for Markov chains
- Finitary logics for some CCS observational bisimulations
- Compositional verification of concurrent systems by combining bisimulations
- A logical process calculus
- Title not available (Why is that?)
- Branching time and orthogonal bisimulation equivalence
- A general approach to comparing infinite-state systems with their finite-state specifications
- Title not available (Why is that?)
- Two implementation relations and the correctness of communicating replicated processes
- Cartesian difference categories
- Title not available (Why is that?)
- Translating Java for multiple model checkers: The Bandera back-end
- Theory of interaction
- Studying equivalences of transition systems with algebraic tools
- Translations between modal logics of reactive systems
- An \(\mathcal O(m\log n)\) algorithm for computing stuttering equivalence and branching bisimulation
- Next-preserving branching bisimulation
- An \(O(m \log n)\) algorithm for branching bisimilarity on labelled transition systems
- Compositional specification in rewriting logic
- Geometric Model Checking of Continuous Space
- Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal
- Model Checking Value-Passing Modal Specifications
- Folk Theorems on the Correspondence between State-Based and Event-Based Systems
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
- Apartness and distinguishing formulas in Hennessy-Milner logic
- Equivalence checking 40 years after: a review of bisimulation tools
- Modelling mutual exclusion in a process algebra with time-outs
- Abstraction and abstraction refinement
- Title not available (Why is that?)
- From EU projects to a family of model checkers. From Kandinsky to KandISTI
- Egalitarian State-Transition Systems
- Smaller Abstractions for ∀CTL* without Next
- Algebraic characterizations of trace and decorated trace equivalences over tree-like structures
- An automated quantitative information flow analysis for concurrent programs
- Title not available (Why is that?)
- On bisimilarity for polyhedral models and \texttt{SLCS}
- A Spatial Logic for Simplicial Models
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)
