{ "vercy": "1.0-draft", "publication": { "status": "research-draft", "adjudicationStatus": "unreviewed", "publishableCanonical": false, "generatedAt": "2026-09-12T08:19:01Z", "providers": [ "Codex" ], "breadth": "recalled by Codex without web access - no source was read", "missingProviders": [], "pass": 2, "cost": { "grok": { "seconds": 22.7, "error": "Reading additional input from stdin...\nOpenAI Codex v0.153.4\n--------\nworkdir: R:\\02_PROJECTS\\02_Meta_Models_Platforms\\Ver.cy\\current\\thing-registry-backlog\nmodel: gpt-6-astra\nprovider: openai\napproval: never\nsandbox: read-only\nreasoning effort: none\nreasoning summaries: none\nsession id: 01a094b1-89c7-7531-ac9c-09f4691b6fc2\n--------\nuser\nDescribe what is already known about one registered thing. Answer as JSON only, no prose around it.\n\nThing: Büchi automaton\nSense to describe: (none recorded)\nDomain code: INF.KNW\nAlso known as: (none)\n\n\nContext for this batch of 1001 things:\n# Batch 043: 1001", "usd": 0.0, "recall": true }, "codex": { "seconds": 84.8, "error": "WARNING: failed to clean up stale arg0 temp dirs: Access is denied. (os error 5)\nReading additional input from stdin...\nOpenAI Codex v0.153.4\n--------\nworkdir: R:\\02_PROJECTS\\02_Meta_Models_Platforms\\Ver.cy\\current\\thing-registry-backlog\nmodel: gpt-6-astra\nprovider: openai\napproval: never\nsandbox: read-only\nreasoning effort: none\nreasoning summaries: none\nsession id: 01a094b1-8a24-7333-af89-cb302ea37c86\n--------\nuser\nYou are drafting a Vercy meta-model for one registered thing. Answer as JSON only, no prose around it.\n\nThing: Büchi automaton\nRegistry id: vr.tr.b-chi-automaton\nPlane / domain: I" } }, "enrichment": { "pass": 3, "engine": "claude", "producedAt": "2026-10-06T12:00:00Z", "ingestedAt": "2026-10-06T08:45:54+00:00", "fields": [ "agent_conduct", "ethics", "failure_modes_and_hazards", "owners", "visual_identification" ] }, "gate": { "passed": true, "version": "1.0", "at": "2026-10-07T10:10:25+00:00", "evidence": [ "completeness 1.00", "sense: Wikidata description", "2 live sources", "review by codex: pass" ] } }, "metaModel": { "id": "THING-Q1020380", "registryId": "vr.tr.b-chi-automaton", "name": "Büchi automaton", "version": "0.1.0-research.1", "entryKind": "thing", "family": "Thing Registry", "domain": [ "INF.KNW" ], "status": "research-draft" }, "canonicalUrl": "https://ver.cy/models/thing/q1020380/", "model": { "registry_id": "vr.tr.b-chi-automaton", "name": "Büchi automaton", "purpose": "Enable an agent to identify a Büchi automaton, interpret its infinite-word language, assess its acceptance behavior, and select sound verification or transformation operations.", "definition": "A Büchi automaton is a finite-state automaton on infinite words that accepts a word if at least one run over that word visits designated accepting states infinitely often.", "scope_statement": "This model owns finite-state Büchi automata over infinite words, their transition and acceptance semantics, representations, behavioral evidence, and transformation constraints; ordinary nondeterministic state-based acceptance is the baseline, with deterministic and transition-based variants explicitly identified.", "in_scope": [ "Finite states, input alphabet, initial states, transition relation, and accepting states or transitions", "Infinite runs and existential Büchi acceptance of infinite input words", "Determinism, completeness, reachability, and recurrent accepting behavior", "Language emptiness, ultimately periodic witnesses, and language comparison", "Acceptance-preserving transformations and use in automata-based verification" ], "out_of_scope": [ "Automata theory as a discipline and its institutional classifications", "Finite-word automata whose acceptance depends on the state at termination", "Generalized Büchi, co-Büchi, parity, Rabin, and Streett automata as independent acceptance formalisms", "Infinite-tree, alternating, probabilistic, and timed automata beyond explicitly recorded conversions", "Temporal-logic specifications and transition systems independently of their mappings to this automaton", "Model-checking software implementation and execution infrastructure" ], "distinguishing_features": [ "Its inputs are infinite sequences over an alphabet, so acceptance does not depend on reaching an end-of-input state.", "In the ordinary state-based convention, a run accepts exactly when it visits the accepting set infinitely often; reaching it once is insufficient. See [Automata and Infinite Words](https://www.sciencedirect.com/science/article/pii/S0079816904800023).", "For nondeterministic word automata, one accepting run suffices; acceptance does not require every possible run to accept.", "Ordinary Büchi acceptance has one recurring acceptance obligation; generalized Büchi acceptance requires recurrence for each designated acceptance set.", "A transition-based representation marks recurring transitions instead of states and must declare that convention. See [Spot acceptance concepts](https://spot.lre.epita.fr/concepts.html)." ], "characteristics": [ { "name": "Automaton signature", "kind": "relation", "unit_or_values": "A = (Q, Σ, Δ, I, F), with finite Q and Σ, Δ ⊆ Q × Σ × Q, I ⊆ Q, and F ⊆ Q for the baseline convention", "why_it_matters": "Identifies the mathematical components that jointly determine the accepted language." }, { "name": "Alphabet interpretation", "kind": "category", "unit_or_values": "Explicit symbols or symbolic encodings, including valuations of a finite atomic-proposition set", "why_it_matters": "Determines what a transition label means and whether automata can be composed or compared." }, { "name": "Acceptance placement", "kind": "category", "unit_or_values": "State-based or transition-based; one Büchi acceptance set", "why_it_matters": "Controls how recurrence is evaluated and how representations may be converted." }, { "name": "Branching discipline", "kind": "category", "unit_or_values": "Deterministic or nondeterministic, including the declared initial-state convention", "why_it_matters": "Constrains algorithms and prevents assuming that arbitrary nondeterministic Büchi automata have deterministic Büchi equivalents." }, { "name": "Transition completeness", "kind": "state", "unit_or_values": "Complete, incomplete, or unchecked relative to the declared alphabet", "why_it_matters": "Determines whether some input letters leave a run without a successor." }, { "name": "Representation size", "kind": "measurement", "unit_or_values": "State count, transition-record count, and symbolic-label size under a named encoding", "why_it_matters": "Supports resource estimates without confusing symbolic edges with individual letter transitions." }, { "name": "Language emptiness", "kind": "state", "unit_or_values": "Empty, nonempty, or unchecked, with supporting certificate or witness", "why_it_matters": "Determines whether any infinite input has an accepting run." }, { "name": "Specification correspondence", "kind": "relation", "unit_or_values": "Source formula or system, alphabet mapping, translation convention, and preservation claim", "why_it_matters": "Connects accepted words to the property or behavior the automaton is intended to represent." } ], "affordances": [ "Validate the transition structure, alphabet interpretation, and declared Büchi acceptance convention.", "Check language emptiness and extract an accepting prefix-and-loop witness when one exists.", "Decide acceptance for a supplied ultimately periodic word using a finite representation of its repeating suffix.", "Compare languages through sound inclusion or equivalence procedures and retain counterexample words.", "Compose compatible automata for verification using a construction that preserves all required acceptance obligations.", "Simplify or convert the automaton while recording the preserved language and any change of acceptance formalism." ], "agent_conduct": { "may": [ "Explain Büchi automata and their role in model checking of infinite behaviours.", "Construct or check automata for properties in systems it is authorized to verify." ], "must_not": [ "Present a system as verified when the automaton or property does not match the specification.", "Hide state-space limits or timeouts that left a check incomplete.", "Copy proofs or constructions from published works without credit." ], "requires_human": [ "Signing off safety-critical systems based on model-checking results." ] }, "ethics": { "considerations": [ "Verification results are trusted for safety-critical systems, so false assurance can harm people." ], "affected_parties": [ "Users of verified systems", "Engineers", "Students" ] }, "owners": { "steward": "Nobody owns it; it is a concept of automata theory.", "master_systems": [] }, "visual_identification": [ "Drawn as a state diagram with accepting states marked by double circles, read over infinite input." ], "failure_modes_and_hazards": [ "Mistranslated properties give false assurance that a system is safe.", "State explosion can stop checks before completion." ], "what_it_is_for": [ "A Buchi automaton represents permitted or prohibited infinite sequences in formal language theory and automated verification.", "It is used in model checking to reason about ongoing system behavior, including properties that require events to recur indefinitely." ], "facets_not_applicable": { "interfaces": "No specific technical standard or regulation is intrinsic to this mathematical automaton type." } }, "sources": [ { "id": "wikidata", "title": "Wikidata item Q1020380: Büchi automaton", "url": "https://www.wikidata.org/wiki/Q1020380", "url_status": "live", "what_it_supports": "identity and sense of the item", "checked_by": "wikidata-api" }, { "id": "wikipedia-en", "title": "Wikipedia: Büchi automaton", "url": "https://en.wikipedia.org/wiki/B%C3%BCchi_automaton", "url_status": "live", "what_it_supports": "general description of the item", "checked_by": "wikidata-api sitelink" } ], "structure": { "bundles": [ { "id": "word-and-run-semantics", "name": "Word and run semantics", "description": "The finite structure and interpretation that turn infinite input sequences into runs.", "rationale": "A graph alone does not specify a Büchi automaton's language without labels, starting conditions, and run semantics.", "layers": [ { "id": "alphabet-and-labels", "name": "Alphabet and labels", "description": "The input universe and the meaning of transition labels.", "findings": [ { "id": "label-denotation", "name": "Label denotation", "description": "Record whether labels denote individual letters or sets of letters through Boolean guards, including the atomic-proposition interpretation.", "questions": [ { "text": "What is Σ, and what concrete input observation does each letter denote?", "kind": "definition", "id": "label-denotation-q01" }, { "text": "How are symbolic guards interpreted, and which guards denote no possible input?", "kind": "boundary", "id": "label-denotation-q02" } ] } ] }, { "id": "initialization-and-successors", "name": "Initialization and successors", "description": "How a run starts and advances through the finite state space.", "findings": [ { "id": "legal-run", "name": "Legal run", "description": "For w = a0a1…, a run q0q1… starts in I and satisfies (qi, ai, qi+1) ∈ Δ at every position; a finite dead end is not an accepting infinite run.", "questions": [ { "text": "Which states are initial, and which labeled successors are permitted from each state?", "kind": "definition", "id": "legal-run-q01" }, { "text": "Do any states lack successors for some letters in the declared alphabet?", "kind": "measurement", "id": "legal-run-q02" } ] } ] } ] }, { "id": "buchi-acceptance", "name": "Büchi acceptance", "description": "The recurring obligation that distinguishes accepting infinite runs.", "rationale": "Acceptance errors commonly arise from replacing infinite recurrence with finite reachability or changing the quantification over runs.", "layers": [ { "id": "recurrence-obligation", "name": "Recurrence obligation", "description": "The designated accepting set and the event required infinitely often.", "findings": [ { "id": "accepting-recurrence", "name": "Accepting recurrence", "description": "For state-based acceptance, Inf(r) ∩ F must be nonempty. Transition-based acceptance instead requires infinitely many occurrences of marked transitions.", "questions": [ { "text": "Which states or transitions carry the single Büchi acceptance mark?", "kind": "definition", "id": "accepting-recurrence-q01" }, { "text": "Does the encoded condition require infinite recurrence, rather than one visit or eventual permanent residence?", "kind": "boundary", "id": "accepting-recurrence-q02" } ] } ] }, { "id": "run-quantification", "name": "Run quantification", "description": "How individual accepting runs determine word acceptance.", "findings": [ { "id": "existential-word-acceptance", "name": "Existential word acceptance", "description": "An infinite word belongs to the language when at least one legal run satisfies the Büchi condition.", "questions": [ { "text": "Is acceptance existential over runs, as required by the baseline nondeterministic word semantics?", "kind": "definition", "id": "existential-word-acceptance-q01" }, { "text": "Does an imported artifact introduce universal branching or another semantics requiring a neighboring model?", "kind": "boundary", "id": "existential-word-acceptance-q02" } ] } ] } ] }, { "id": "recurrent-structure-and-witnesses", "name": "Recurrent structure and witnesses", "description": "Finite graph evidence for infinite accepting behavior.", "rationale": "An agent needs checkable evidence of acceptance or emptiness, including the distinction between a reachable accepting state and repeatable accepting behavior.", "layers": [ { "id": "accepting-components", "name": "Accepting components", "description": "Reachable strongly connected structure capable of sustaining acceptance.", "findings": [ { "id": "accepting-cycle-test", "name": "Accepting cycle test", "description": "In a state-based automaton, nonemptiness requires a reachable strongly connected component containing an accepting state and a nonempty cycle through it, using feasible transitions.", "questions": [ { "text": "Which reachable strongly connected components support a cycle through an accepting state?", "kind": "measurement", "id": "accepting-cycle-test-q01" }, { "text": "Have singleton components without self-loops and transitions with unsatisfiable guards been excluded?", "kind": "boundary", "id": "accepting-cycle-test-q02" } ] } ] }, { "id": "lasso-evidence", "name": "Lasso evidence", "description": "Finite certificates describing accepting infinite repetition.", "findings": [ { "id": "prefix-and-loop-witness", "name": "Prefix and loop witness", "description": "Record a finite path from an initial state followed by a nonempty repeatable accepting loop, together with an input word uv^ω where v is nonempty.", "questions": [ { "text": "What prefix, loop, and corresponding input labels constitute the nonemptiness witness?", "kind": "measurement", "id": "prefix-and-loop-witness-q01" }, { "text": "Can each step and the accepting recurrence be independently replayed against this exact automaton?", "kind": "action", "id": "prefix-and-loop-witness-q02" } ] } ] } ] }, { "id": "representation-and-transformation", "name": "Representation and transformation", "description": "Structural classifications and constraints on language-preserving changes.", "rationale": "Operations familiar from finite automata can change infinite-word languages when applied without the correct acceptance construction.", "layers": [ { "id": "determinism-and-encoding", "name": "Determinism and encoding", "description": "Properties of the actual representation that govern available algorithms.", "findings": [ { "id": "verified-structural-properties", "name": "Verified structural properties", "description": "Record determinism, completeness, and acceptance placement as checked properties; for symbolic labels, determinism depends on guard overlap.", "questions": [ { "text": "Can one input letter enable distinct successors from the same state, or can a word start from multiple initial states?", "kind": "measurement", "id": "verified-structural-properties-q01" }, { "text": "Which structural properties were verified, by what procedure, and for which artifact revision?", "kind": "provenance", "id": "verified-structural-properties-q02" } ] } ] }, { "id": "language-preservation", "name": "Language preservation", "description": "Proof obligations for reduction, composition, complementation, and conversion.", "findings": [ { "id": "operation-preconditions", "name": "Operation preconditions", "description": "Require operation-specific acceptance handling: intersection must enforce both recurrence obligations, complementation is not simple accepting-set inversion, and determinization may require another acceptance formalism.", "questions": [ { "text": "What construction establishes the intended language relation between the input and output automata?", "kind": "action", "id": "operation-preconditions-q01" }, { "text": "Does the result retain ordinary Büchi acceptance, or must it be represented under a different acceptance model?", "kind": "boundary", "id": "operation-preconditions-q02" } ] } ] } ] }, { "id": "verification-meaning", "name": "Verification meaning", "description": "How the accepted language connects to specifications and verification conclusions.", "rationale": "An accepting witness can mean desired behavior or a violation, depending on translation polarity and system composition.", "layers": [ { "id": "specification-origin", "name": "Specification origin", "description": "The semantic contract of a generated or supplied automaton.", "findings": [ { "id": "translation-contract", "name": "Translation contract", "description": "Record the source specification, proposition mapping, and whether accepted words satisfy the property or its negation.", "questions": [ { "text": "Which formula or behavioral requirement produced this automaton, and with what polarity?", "kind": "provenance", "id": "translation-contract-q01" }, { "text": "How do source observations map to alphabet letters and positions in the infinite word?", "kind": "definition", "id": "translation-contract-q02" } ] } ] }, { "id": "product-and-conclusion", "name": "Product and conclusion", "description": "The assumptions needed to interpret verification through a product automaton.", "findings": [ { "id": "verification-result-contract", "name": "Verification result contract", "description": "For a product representing system behaviors intersected with property violations, nonemptiness supplies a counterexample; emptiness supports the property only under the recorded modeling assumptions.", "questions": [ { "text": "How are system labels, deadlocks, and fairness assumptions incorporated into the product?", "kind": "boundary", "id": "verification-result-contract-q01" }, { "text": "What conclusion does emptiness or a returned lasso justify for the original system and property?", "kind": "action", "id": "verification-result-contract-q02" } ] } ] } ] }, { "id": "evidence-and-external-alignment", "name": "Evidence and external alignment", "description": "What the world already says about this thing, gathered so the model can be checked against it.", "rationale": "A model that cannot be lined up against existing standards, identifiers and practice cannot be adopted by anyone who already uses them.", "layers": [ { "id": "reported-evidence", "name": "Reported evidence", "description": "Findings from the breadth pass, kept separate from the structural claims.", "findings": [ { "id": "evidence-confidence-notes", "name": "Check these first", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "This is an abstract mathematical model used in automata theory and formal verification, not a discipline in its own right.", "The definition uses ordinary nondeterministic, state-based acceptance; alternating and transition-based presentations require corresponding semantic adjustments.", "Limit-deterministic definitions differ in technical restrictions between sources, so a publication should specify its convention." ], "questions": [ { "id": "evidence-confidence-notes-q01", "text": "Which of these check these first hold for the sense of Büchi automaton this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-kinds", "name": "Kinds and varieties", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "Nondeterministic Büchi automaton", "Deterministic Büchi automaton", "Generalized Büchi automaton", "Limit-deterministic Büchi automaton", "Alternating Büchi automaton" ], "questions": [ { "id": "evidence-kinds-q01", "text": "Which of these kinds and varieties hold for the sense of Büchi automaton this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-real-world-use", "name": "Real-world use", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "Representing temporal specifications in automata-based model checking.", "Checking reactive systems for violations of linear temporal logic properties.", "Representing omega-regular languages of infinite execution traces.", "Supporting controller synthesis and verification of nonterminating systems." ], "questions": [ { "id": "evidence-real-world-use-q01", "text": "Which of these real-world use hold for the sense of Büchi automaton this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-failure-modes-and-hazards", "name": "Failure modes and hazards", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ "Treating a single visit to an accepting state as sufficient; acceptance requires infinitely many visits.", "Assuming deterministic Büchi automata recognize every omega-regular language; they are strictly less expressive than nondeterministic Büchi automata.", "Complementing a Büchi automaton merely by swapping accepting and nonaccepting states, which is generally incorrect.", "State-space explosion during translation, complementation, or product construction.", "Applying infinite-trace semantics to terminating executions without explicitly choosing a treatment of termination." ], "questions": [ { "id": "evidence-failure-modes-and-hazards-q01", "text": "Which of these failure modes and hazards hold for the sense of Büchi automaton this model covers, and on what evidence?", "kind": "provenance" } ] }, { "id": "evidence-neighbours", "name": "Neighbouring kinds and how to tell them apart", "description": "Recalled without web access and unsourced; every item is a lead to verify.", "evidence": [ { "name": "Finite-word automaton", "difference": "Accepts finite words using an end-of-input condition; a Büchi automaton accepts infinite words using recurring visits to accepting states." }, { "name": "Generalized Büchi automaton", "difference": "Requires infinitely many visits to every designated accepting set, whereas an ordinary Büchi automaton has one accepting set; the two have equal expressive power under nondeterministic semantics." }, { "name": "Co-Büchi automaton", "difference": "Requires designated rejecting states to occur only finitely often, rather than designated accepting states to occur infinitely often." }, { "name": "Parity automaton", "difference": "Uses priorities and a parity condition on priorities recurring infinitely often; deterministic parity automata can recognize all omega-regular languages." }, { "name": "Omega-regular language", "difference": "Is a set of infinite words; a nondeterministic Büchi automaton is a finite representation recognizing such a set." }, { "name": "Linear temporal logic", "difference": "Is a specification language with temporal operators; Büchi automata provide an operational representation for its infinite-word formulas." } ], "questions": [ { "id": "evidence-neighbours-q01", "text": "Which of these neighbouring kinds and how to tell them apart hold for the sense of Büchi automaton this model covers, and on what evidence?", "kind": "provenance" } ] } ] } ] } ] }, "openQuestions": [ "Does the registry intend only the conventional state-based word automaton, or should transition-based Büchi automata be first-class variants within this entry?", "Does an existing Vercy world model already own this concept or its finite-state omega-automaton foundation?", "Which authoritative definition and notation should govern initial-state multiplicity, incomplete transitions, and symbolic alphabet encodings?", "Which exchange format and independent validation procedure should support reproducible acceptance and language-preservation evidence?", "Should specialized subclasses such as weak or limit-deterministic Büchi automata be recorded as characteristics here or linked to separately registered concepts?" ], "statistics": { "bundles": 6, "layers": 11, "findings": 15, "questions": 25 } }