MétaCan
Menu
Back to cohort
Record W2132077963 · doi:10.1109/cdc.1998.761812

The COCO/sup DEF/ approach to COCOLOG logic control

2002· article· en· W2132077963 on OpenAlexaff
C. Martínez-Mascarúa, Peter E. Caines

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPetri Nets in System Modeling
Canadian institutionsMcGill University
Fundersnot available
KeywordsReachabilityAxiomPredicate (mathematical logic)Computer scienceMacroTheoretical computer scienceReachability problemRelation (database)Algebra over a fieldPredicate logicExpression (computer science)MathematicsDiscrete mathematicsProgramming languageDescription logicPure mathematics

Abstract

fetched live from OpenAlex

In this paper, we present the application of Macro COCOLOG definition expressions to COCOLOG control theories themselves. In particular, the reachability relation on systems which can be modeled in COCOLOG is shown to have a definition in a subset of the basic axiom set of COCOLOG. The definition of the reachability predicate is then explored in the light of possible extensions to the arithmetic system in COCOLOG. Given the fact that reachability is a fundamental system-theoretic concept, the definition expression describing this predicate is given the special status of a definitional axiom. The application of definability theory to COCOLOG control theories then gives rise to COCO/sup DEF/, in which the original COCOLOG framework is shown to have an equivalent definitional framework. Furthermore, Macro actions themselves are shown to have a definitional expression equivalent to them. A couple of examples used elsewhere in the Macro COCOLOG framework are then reformulated to show the application of this approach.

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.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: Empirical · Consensus signal: none
Teacher disagreement score0.929
Threshold uncertainty score0.913

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

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.046
GPT teacher head0.242
Teacher spread0.196 · 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.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicPetri Nets in System ModelingFrench-language works237,207