scientific article; zbMATH DE number 7559462

DOI10.4230/LIPICS.CONCUR.2020.6MaRDI QIDQ5089269zbMATH OpenFDO

Authors Rob van Glabbeek

Publication date 18 July 2022

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

zbMATH Keywords

complete axiomatisationsHennessy-Milner logiclabelled transition systemsmodal characterisationsprocess algebrareactive bisimulation semanticsrecursiontime-outs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A complete axiomatisation for observational congruence of finite-state behaviours
• A complete inference system for a class of regular behaviours
• A Theory of Communicating Sequential Processes
• A timed model for communicating sequential processes
• Algebraic laws for nondeterminism and concurrency
• Analysing mutual exclusion using process algebra with signals
• Axiomatising divergence
• Bisimulation and divergence
• Branching time and abstraction in bisimulation semantics
• Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations.
• 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
• scientific article; zbMATH DE number 4037225 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 1412988 (Why is no real title available?)
• Off-the-shelf automated analysis of liveness properties for just paths
• Process Algebra
• Recursion induction for real-time processes
• Specification-oriented semantics for communicating processes
• Structured operational semantics and bisimulation as a congruence
• Testing equivalences for processes
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• The meaning of negative premises in transition system specifications. II
• Transition system specifications with negative premises

Cited in

(5)

• Reactive bisimulation semantics for a process algebra with timeouts
• Removing redundant refusals: minimal complete test suites for failure trace semantics
• scientific article; zbMATH DE number 1267564 (Why is no real title available?)
• Failure trace semantics for a process algebra with time-outs
• 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 Q5089269)