A simple proof technique for priority-scheduled systems

DOI10.1016/S0020-0190(00)00193-9zbMath1003.68085OpenAlexW2030791988WikidataQ127778803 ScholiaQ127778803MaRDI QIDQ1607082

Mark Moir, James H. Anderson, Srikanth Ramamurthy

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00193-9

zbMATH Keywords

concurrent programspriority-scheduled systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Real-time object sharing with minimal system support
• Wait-free synchronization in multiprogrammed systems
• Implementing wait-free objects on priority-based systems
• Priority inheritance protocols: an approach to real-time synchronization

This page was built for publication: A simple proof technique for priority-scheduled systems