Verifying safety critical task scheduling systems in PPTL axiom system
From MaRDI portal
Publication:5963639
DOI10.1007/S10878-014-9776-3zbMATH Open1333.90055OpenAlexW2076669467WikidataQ114017540 ScholiaQ114017540MaRDI QIDQ5963639FDOQ5963639
Bin Gu, Mengfei Yang, Cong Tian, Nan Zhang, Zhenhua Duan
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9776-3
Recommendations
- A formal proof of the deadline driven scheduler in PPTL axiomatic system
- Verifying a scheduling protocol of safety-critical systems
- Modeling and verification of processes scheduling based on projection temporal logic for multi-core CPUs
- Complete axiomatization for projection temporal logic with finite time
- Formalising scheduling theories in duration calculus
Cites Work
- Title not available (Why is that?)
- Isabelle. A generic theorem prover
- Title not available (Why is that?)
- Temporal logic can be more expressive
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Complexity of propositional projection temporal logic with star
- A complete proof system for propositional projection temporal logic
Cited In (2)
Uses Software
This page was built for publication: Verifying safety critical task scheduling systems in PPTL axiom system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963639)
