Blocking in Parameterized Networks of Discrete-Event-Systems
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.
Bibliographic record
Abstract
The problem of checking blocking is addressed for two different types of networks that are fully connected, in the graph-theoretic sense. In the first framework, a network consists of an arbitrary number of identical processes and a possibly distinguished control process. Their communication is according to Milner's calculus of communicating systems (CCS). It is shown that the problems of testing such networks for two kinds of blocking, component blocking (CBP) and network blocking (NBP), are decidable. The results are also extended to networks consisting of a finite number of process classes where each class contains an arbitrary number of identical processes. In the second framework, networks consist of isomorphic processes; i.e., all processes are obtained from a unique template by appropriate relabelling. This framework differs from the previous one because processes are distinguishable. It is shown that the halting problem can be reduced to CBP and NBP of such networks, and therefore, they are undecidable.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.001 |
| Bibliometrics | 0.001 | 0.004 |
| Science and technology studies | 0.000 | 0.004 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.007 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it