MétaCan
Menu
Back to cohort
Record W2057562551 · doi:10.1016/j.procs.2013.06.144

Towards a Distributed Plan Execution Monitoring Framework

2013· article· en· W2057562551 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

VenueProcedia Computer Science · 2013
Typearticle
Languageen
FieldComputer Science
TopicFormal Methods in Verification
Canadian institutionsDefence Research and Development CanadaConcordia University
Fundersnot available
KeywordsComputer scienceScalabilityPlan (archaeology)Distributed computingAutomatonContext (archaeology)Runtime verificationScale (ratio)Software engineeringFormal verificationProgramming languageTheoretical computer scienceDatabase

Abstract

fetched live from OpenAlex

Distributed monitoring is challenging yet essential in order to address scalability issues observed in the context of large-scale plan execution. A formal framework can be very helpful in analyzing and reasoning about plan spec- ification, execution, and monitoring. In this paper, we elaborate on a distributed monitoring calculus framework that allows specifying and executing plans for multi-agent systems in a distributed environment. The framework allows taking into account a highly dynamic and uncertain environment that can be a contributor to the changing conditions possibly disrupting and causing the plan to fail. Furthermore, the calculus provides sound foundations for designing and evaluating monitoring algorithms and protocols. In order to achieve effective monitoring, we propose an automata- based approach, inspired by runtime security verification research initiatives. The proposed automata allow enforcing monitoring properties while the given plan is executed at the agent's side.

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.001
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: Methods · Consensus signal: Methods
Teacher disagreement score0.819
Threshold uncertainty score0.985

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0000.000
Scholarly communication0.0010.003
Open science0.0030.001
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.030
GPT teacher head0.290
Teacher spread0.259 · 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