scientific article; zbMATH DE number 7453963

MaRDI QIDQ5020945zbMATH OpenFDO

Authors Rob van Glabbeek

Publication date 7 January 2022

Full work available at URL https://arxiv.org/abs/2008.13357, http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS2020.6

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

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

Cited in

(3)

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

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)