MétaCan
Menu
Back to cohort
Record W1865640539 · doi:10.1109/acsd.2005.28

Much Compact Time Petri Net State Class Spaces Useful to Restore CTL* Properties

2006· article· en· W1865640539 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
TopicPetri Nets in System Modeling
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsPetri netCTL*Computer scienceTheoretical computer scienceComputationGraphStochastic Petri netState spaceModel checkingAlgorithmDiscrete mathematicsDistributed computingMathematics

Abstract

fetched live from OpenAlex

This paper deals with the verification of CTL* properties of Time Petri Nets (TPN model). To verify such properties, we need to contract the generally infinite state space of the TPN model into a finite graph that preserves its CTL* properties. Such a graph can be constructed using a partition refinement technique, where an intermediate graph, representing a contraction of the TPN state space, is first built then refined until CTL* properties are restored. Comparing to other approaches, we propose to construct much compact intermediate graphs. Experimental results have shown that our contractions are very appropriate to boost the refinement procedure. We have been able to reduce computation times by factors reaching four and more in certain cases. Resulting graphs have also been reduced in size.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.650
Threshold uncertainty score1.000

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.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.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.031
GPT teacher head0.236
Teacher spread0.205 · 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

Citations12
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicPetri Nets in System ModelingFrench-language works237,207