MétaCan
Menu
Back to cohort
Record W2995907685 · doi:10.1016/j.entcs.2019.09.004

Bisimulation for Feller-Dynkin Processes

2019· article· en· W2995907685 on OpenAlexafffund
Linan Chen, Florence Clerc, Prakash Panangaden

Bibliographic record

VenueElectronic Notes in Theoretical Computer Science · 2019
Typearticle
Languageen
FieldComputer Science
TopicFormal Methods in Verification
Canadian institutionsMcGill University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsBisimulationDiscrete time and continuous timeEquivalence (formal languages)GeneralizationMathematicsMarkov chainMarkov processTime reversibilityPure mathematicsAlgebra over a fieldDiscrete mathematicsMarkov propertyMarkov modelMathematical analysis

Abstract

fetched live from OpenAlex

Bisimulation is a concept that captures behavioural equivalence. It has been studied extensively on nonprobabilistic systems and on discrete-time Markov processes and on so-called continuous-time Markov chains. In the latter, time is continuous but the evolution still proceeds in jumps. We propose two definitions of bisimulation on continuous-time stochastic processes where the evolution is a flow through time. We show that they are equivalent and we show that when restricted to discrete-time, our concept of bisimulation encompasses the standard discrete-time concept. The concept we introduce is not a straightforward generalization of discrete-time concepts.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.010
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.010
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.003
Scholarly communication0.0020.004
Open science0.0010.002
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0030.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.011
GPT teacher head0.293
Teacher spread0.282 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
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

Citations3
Published2019
Admission routes2
Has abstractyes

Explore more

Same venueElectronic Notes in Theoretical Computer ScienceSame topicFormal Methods in VerificationFrench-language works237,207