MétaCan
Menu
Back to cohort
Record W2373763064

Mapping from Real-time Temporal Logic Language XYZ/RE to Timed Automata

2008· article· en· W2373763064 on OpenAlexvenueno aff
Guangquan Zhang

Bibliographic record

VenueMicrocomputer applications · 2008
Typearticle
Languageen
FieldComputer Science
TopicFormal Methods in Verification
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceAutomatonTimed automatonTemporal logicModel checkingProcess (computing)Real-time operating systemProgramming languageLinear temporal logicTheoretical computer scienceReal-time computingEmbedded system
DOInot available

Abstract

fetched live from OpenAlex

Timed Automata is an important tool for modeling real-time systems.This paper presents a mechanism for mapping real-time temporal logic language XYZ/RE to Timed Automata,translating systems' process described by XYZ/RE into Time Automata,then which can not only capture real-time systems' functionalities and control behaviour precisely,but also can use verified tool based on Timed Automata to check accuracy of the systems described by XYZ/RE.At last,the paper verified the validation of the mechanism by describing and checking an example.

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.

How this classification was reachedexpand

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.659
Threshold uncertainty score0.998

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.003

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.028
GPT teacher head0.285
Teacher spread0.256 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designNot applicable
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueMicrocomputer applicationsSame topicFormal Methods in VerificationFrench-language works237,207