scientific article; zbMATH DE number 7453963

MaRDI QIDQ5020945

Robert J. van Glabbeek

Publication date: 7 January 2022

Full work available at URL: https://arxiv.org/abs/2008.13357

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Modelling mutual exclusion in a process algebra with time-outs ⋮ Just testing

Cites Work

• Unnamed Item
• Using branching time temporal logic to synthesize synchronization skeletons
• A calculus of communicating systems
• Myths about the mutual exclusion problem
• Abstract processes of place/transition systems
• Ensuring liveness properties of distributed systems: open problems
• Justness. A completeness criterion for capturing liveness properties (extended abstract)
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Three logics for branching bisimulation
• A new solution of Dijkstra's concurrent programming problem
• Logic in Computer Science
• Analysis of A time‐shared processor