Off-the-shelf automated analysis of liveness properties for just paths (extended abstract)

DOI10.1007/978-3-030-78089-0_11MaRDI QIDQ2117021zbMATH OpenOpenAlexFDO

Authors Mark Bouwman, Bas Luttik, T. A. C. Willemse

Publication date 21 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-78089-0_11

Mathematics Subject Classification ID

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

Recommendations

• Off-the-shelf automated analysis of liveness properties for just paths
• Automated analysis of mutual exclusion algorithms using CCS
• scientific article; zbMATH DE number 7317251
• scientific article; zbMATH DE number 177518
• Static Livelock Analysis in CSP

Cites work

• Analysing mutual exclusion using process algebra with signals
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Evidence for Fixpoint Logic
• Justness. A completeness criterion for capturing liveness properties (extended abstract)
• Off-the-shelf automated analysis of liveness properties for just paths

Cited in

(2)

• Liveness of a mutex algorithm in a fair process algebra
• Off-the-shelf automated analysis of liveness properties for just paths

Describes a project that uses

Uses Software

• mCRL2

This page was built for publication: Off-the-shelf automated analysis of liveness properties for just paths (extended abstract)

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