Justness. A completeness criterion for capturing liveness properties (extended abstract)

DOI10.1007/978-3-030-17127-8_29MaRDI QIDQ2289100zbMATH OpenOpenAlexFDO

Authors Rob van Glabbeek

Publication date 28 January 2020

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• Off-the-shelf automated analysis of liveness properties for just paths
• On the refinement of liveness properties of distributed systems
• Liveness in timed and untimed systems
• scientific article; zbMATH DE number 1863165
• scientific article; zbMATH DE number 140260

Cited in

(10)

• Ensuring liveness properties of distributed systems: open problems
• Off-the-shelf automated analysis of liveness properties for just paths (extended abstract)
• Off-the-shelf automated analysis of liveness properties for just paths
• scientific article; zbMATH DE number 7453963 (Why is no real title available?)
• Modelling mutual exclusion in a process algebra with time-outs
• Just testing
• Fair must testing for I/O automata
• Progress, justness and fairness in modal -calculus formulae
• A lean-congruence format for ep-bisimilarity
• Just verification of mutual exclusion algorithms

This page was built for publication: Justness. A completeness criterion for capturing liveness properties (extended abstract)

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