scientific article; zbMATH DE number 7453963

MaRDI QIDQ5020945FDOQ5020945

Authors: Rob van Glabbeek 

Publication date: 7 January 2022

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

Title of this publication is not available (Why is that?)

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)

Cites Work

• Logic in Computer Science
• Myths about the mutual exclusion problem
• A calculus of communicating systems
• Using branching time temporal logic to synthesize synchronization skeletons
• Title not available (Why is that?)
• Abstract processes of place/transition systems
• A new solution of Dijkstra's concurrent programming problem
• Three logics for branching bisimulation
• Analysis of A time‐shared processor
• 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

Cited In (3)

• Modelling mutual exclusion in a process algebra with time-outs
• Just testing
• Temporal causality in reactive systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020945)