MétaCan
Menu
Back to cohort
Record W2147925690 · doi:10.1109/ccece.2003.1226125

Formal description of a real-time operating system using RTPA

2004· article· en· W2147925690 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCognitive Computing and Networks
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsReal-time operating systemCorrectnessComputer scienceEmbedded systemScheduling (production processes)Process (computing)ArchitectureOperating systemEngineeringProgramming language

Abstract

fetched live from OpenAlex

Most industrial computing systems are real-time systems where rigid time constraints must be met. Great attention should therefore be given to the design of real-time operating system (RTOS) because its malfunction may result in a disaster both to business and human life. Current RTOS's are target-machine and application specific. This paper develops a new architecture of RTOS's, RTOS+, which is generic and portable to different platforms. We adopt real-time process algebra (RTPA) to specify and describe RTOS+, particularly its architecture and dynamic behaviours. On the basis of the formal specification, architecture, behaviours, and correctness of RTOS+ can be guaranteed. The core operations of RTOS+, such as task scheduling, time, event and resource management can be rigorously described for better real-time performance and improved resource utilization.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.768
Threshold uncertainty score0.280

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.031
GPT teacher head0.243
Teacher spread0.212 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations15
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicCognitive Computing and NetworksFrench-language works237,207