Next-preserving branching bisimulation
From MaRDI portal
Publication:2355689
DOI10.1016/j.tcs.2015.05.013zbMath1328.68141OpenAlexW2136356641MaRDI QIDQ2355689
Kirsten Winter, Nisansala Yatapanage
Publication date: 24 July 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.013
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (2)
Cartesian difference categories ⋮ Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A semantics for behavior trees using CSP with specification commands
- Slicing software for model construction
- Issues in slicing PROMELA and its applications to model checking, protocol understanding, and simulation
- Branching time and orthogonal bisimulation equivalence
- The stuttering principle revisited
- Slicing Behavior Tree Models for Verification
- Branching Bisimilarity with Explicit Divergence
- Computation Tree Logic with Deadlock Detection
- Sigref – A Symbolic Bisimulation Tool Box
- SVtL: System Verification Through Logic Tool Support for Verifying Sliced Hierarchical Statecharts
- CSP with Hierarchical State
- Slicing Concurrent Real-Time System Specifications for Verification
- Property-based Slicing for Agent Verification
- The program dependence graph and its use in optimization
- “Sometimes” and “not never” revisited
- Three logics for branching bisimulation
- Branching time and abstraction in bisimulation semantics
- Slicing Petri Nets with an Application to Workflow Verification
- ZB 2005: Formal Specification and Development in Z and B
This page was built for publication: Next-preserving branching bisimulation
