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

DOI10.1007/978-3-030-17127-8_29OpenAlexW4243213620MaRDI QIDQ2289100FDOQ2289100

Authors: Rob van Glabbeek 

Publication date: 28 January 2020

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

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

Mathematics Subject Classification ID

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

Cited In (7)

• Off-the-shelf automated analysis of liveness properties for just paths (extended abstract)
• Off-the-shelf automated analysis of liveness properties for just paths
• Fair must testing for I/O automata
• Modelling mutual exclusion in a process algebra with time-outs
• Just testing
• Title not available (Why is that?)
• Ensuring liveness properties of distributed systems: open problems

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)