scientific article; zbMATH DE number 7453962

MaRDI QIDQ5020944

Wouter Schols, Bas Luttik, Mark Bouwman, Tim A. C. Willemse

Publication date: 7 January 2022

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

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)

Cites Work

• A brief history of process algebra
• Off-the-shelf automated analysis of liveness properties for just paths
• Understanding concurrent systems
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Notions of bisimulation and congruence formats for SOS with data
• Algebraic laws for nondeterminism and concurrency
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: