scientific article; zbMATH DE number 7243676
From MaRDI portal
Publication:5119395
Bas Luttik, Linda Spaninks, Robert J. van Glabbeek
Publication date: 4 September 2020
Full work available at URL: https://arxiv.org/abs/1801.01180
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Rooted divergence-preserving branching bisimilarity is a congruence: a simpler proof ⋮ Unnamed Item ⋮ Counting nondeterministic computations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reactive Turing machines
- A formal verification technique for behavioural model-to-model transformations
- Theory of interaction
- A complete axiomatisation for observational congruence of finite-state behaviours
- Towards a unified approach to encodability and separation results for process calculi
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
- Axiomatising divergence
- Branching Bisimulation Games
- Turing Meets Milner
- On the Executability of Interactive Computation
- Branching Bisimilarity with Explicit Divergence
- Computation Tree Logic with Deadlock Detection
- Branching time and abstraction in bisimulation semantics
- Efficient Property Preservation Checking of Model Refinements
This page was built for publication:
