libpetri 2.13.0 → 3.0.0

package/dist/{petri-net-C3LSY-vm.d.ts → petri-net-UQBBkvLl.d.ts}

@@ -72,7 +72,6 @@ type Arc = ArcInput | ArcOutput | ArcInhibitor | ArcRead | ArcReset;
 interface ArcInput<T = any> {
     readonly type: 'input';
     readonly place: Place<T>;
-    readonly guard?: (value: T) => boolean;
 }
 interface ArcOutput<T = any> {
     readonly type: 'output';
@@ -91,7 +90,7 @@ interface ArcReset<T = any> {
     readonly place: Place<T>;
 }
 /** Input arc: consumes token from place when transition fires. */
-declare function inputArc<T>(place: Place<T>, guard?: (value: T) => boolean): ArcInput<T>;
+declare function inputArc<T>(place: Place<T>): ArcInput<T>;
 /** Output arc: produces token to place when transition fires. */
 declare function outputArc<T>(place: Place<T>): ArcOutput<T>;
 /** Inhibitor arc: blocks transition if place has tokens. */
@@ -102,15 +101,14 @@ declare function readArc<T>(place: Place<T>): ArcRead<T>;
 declare function resetArc<T>(place: Place<T>): ArcReset<T>;
 /** Returns the place this arc connects to. */
 declare function arcPlace(arc: Arc): Place<any>;
-/** Checks if an input arc has a guard predicate. */
-declare function hasGuard(arc: ArcInput): boolean;
-/** Checks if a token value matches an input arc's guard. */
-declare function matchesGuard<T>(arc: ArcInput<T>, value: T): boolean;
 
 /**
- * Input specification with cardinality and optional guard predicate.
- * CPN-compliant: cardinality determines how many tokens to consume,
- * guard filters which tokens are eligible.
+ * Input specification with cardinality. Purely structural (IO-006): cardinality
+ * determines how many tokens to consume; there is no per-token predicate.
+ *
+ * Conditional token selection is modeled with multiple conflicting transitions
+ * and XOR-on-input semantics rather than a predicate coupled to the enablement
+ * check.
  *
  * Inputs are always AND-joined (all must be satisfied to enable transition).
  * XOR on inputs is modeled via multiple transitions (conflict).
@@ -119,33 +117,29 @@ type In = InOne | InExactly | InAll | InAtLeast;
 interface InOne<T = any> {
     readonly type: 'one';
     readonly place: Place<T>;
-    readonly guard?: (value: T) => boolean;
 }
 interface InExactly<T = any> {
     readonly type: 'exactly';
     readonly place: Place<T>;
     readonly count: number;
-    readonly guard?: (value: T) => boolean;
 }
 interface InAll<T = any> {
     readonly type: 'all';
     readonly place: Place<T>;
-    readonly guard?: (value: T) => boolean;
 }
 interface InAtLeast<T = any> {
     readonly type: 'at-least';
     readonly place: Place<T>;
     readonly minimum: number;
-    readonly guard?: (value: T) => boolean;
 }
-/** Consume exactly 1 token (standard CPN semantics). Optional guard filters eligible tokens. */
-declare function one<T>(place: Place<T>, guard?: (value: T) => boolean): InOne<T>;
-/** Consume exactly N tokens (batching). Optional guard filters eligible tokens. */
-declare function exactly<T>(count: number, place: Place<T>, guard?: (value: T) => boolean): InExactly<T>;
-/** Consume all available tokens (must be 1+). Optional guard filters eligible tokens. */
-declare function all<T>(place: Place<T>, guard?: (value: T) => boolean): InAll<T>;
-/** Wait for N+ tokens, consume all when enabled. Optional guard filters eligible tokens. */
-declare function atLeast<T>(minimum: number, place: Place<T>, guard?: (value: T) => boolean): InAtLeast<T>;
+/** Consume exactly 1 token (standard CPN semantics). */
+declare function one<T>(place: Place<T>): InOne<T>;
+/** Consume exactly N tokens (batching). */
+declare function exactly<T>(count: number, place: Place<T>): InExactly<T>;
+/** Consume all available tokens (must be 1+). */
+declare function all<T>(place: Place<T>): InAll<T>;
+/** Wait for N+ tokens, consume all when enabled. */
+declare function atLeast<T>(minimum: number, place: Place<T>): InAtLeast<T>;
 /** Returns the minimum number of tokens required to enable. */
 declare function requiredCount(spec: In): number;
 /**
@@ -191,11 +185,11 @@ declare function nameId(value: string): NameId;
  * On firing, exactly those name-matched tokens are consumed (spec NU-020).
  *
  * This is the single *decidable* predicate — equality of opaque names — and is
- * deliberately NOT a general guard: it correlates the name dimension *across*
- * places (composition-structural, like cardinality) rather than evaluating an
- * arbitrary boolean per token. When both a unary input `guard` and a match are
- * present the guard filters first, then the name correlation runs over the
- * survivors (NU-021).
+ * deliberately NOT a general input predicate: it correlates the name dimension
+ * *across* places (composition-structural, like cardinality) rather than
+ * evaluating an arbitrary boolean per token. Input specifications themselves
+ * remain purely structural (IO-006); name correlation is the only per-token
+ * filter the enablement check ever applies (NU-021).
  */
 
 /**
@@ -228,7 +222,7 @@ declare function matchKey<T>(place: Place<T>, key: KeyFn<T>): MatchKey<T>;
  *     ))
  *
  * @throws if fewer than two inputs are correlated (a match over a single place
- *   is just a guard).
+ *   correlates nothing).
  */
 declare function matchSpec(...keys: MatchKey[]): MatchSpec;
 /** Returns the name projection for `placeName`, or `undefined` if not correlated. */
@@ -1746,7 +1740,8 @@ declare class PetriNetBuilder {
      *    Map<string, Place<unknown>> convention — TypeScript Place identity is
      *    name-based per `runtime/compiled-net.ts`).
      * 3. Walk every transition through {@link applyFusion} to rewrite arc place
-     *    references.
+     *    references; input arcs colliding on a canonical place merge per
+     *    [MOD-021] (additive where summable, rejected otherwise).
      * 4. Re-derive the place set from the rewritten transitions plus any
      *    caller-declared standalone places, dropping non-canonical members.
      *    Caller-declared standalone places that happen to be non-canonical
@@ -1782,4 +1777,4 @@ declare class PetriNetBuilder {
     private buildWithFusion;
 }
 
-export { type VerificationHarness as $, type Arc as A, type Port as B, type Channel as C, type PortDirection as D, type EnvironmentPlace as E, FusionSet as F, SubnetDefBuilder as G, type SubnetInstance as H, type In as I, type Timing as J, type KeyFn as K, type LogFn as L, MAX_DURATION_MS as M, type NameId as N, type Out as O, PetriNet as P, type TimingDeadline as Q, type TimingDelayed as R, SubnetDef as S, type Token as T, type TimingExact as U, type TimingImmediate as V, type TimingWindow as W, TokenInput as X, TokenOutput as Y, type TransitionAction as Z, TransitionBuilder as _, type Place as a, type SmtStatistics as a$, type VerificationResult as a0, all as a1, allPlaces as a2, and as a3, andPlaces as a4, arcPlace as a5, atLeast as a6, consumptionCount as a7, deadline as a8, delayed as a9, produce as aA, readArc as aB, requiredCount as aC, resetArc as aD, timeout as aE, timeoutPlace as aF, tokenAt as aG, tokenOf as aH, transform as aI, transformAsync as aJ, transformFrom as aK, unitToken as aL, window as aM, withTimeout as aN, xor as aO, xorPlaces as aP, MarkingState as aQ, type PInvariant as aR, MarkingStateBuilder as aS, type SmtProperty as aT, type SmtVerificationResult as aU, type BranchPlaceBound as aV, type DeadlockFree as aW, type JoinedOrDeadLettered as aX, type MutualExclusion as aY, type PlaceBound as aZ, type Proven as a_, earliest as aa, enumerateBranches as ab, environmentPlace as ac, exact as ad, exactly as ae, fork as af, forwardInput as ag, hasDeadline as ah, hasGuard as ai, immediate as aj, inhibitorArc as ak, inputArc as al, isPassthrough as am, isUnit as an, keyForPlace as ao, latest as ap, matchCorrelates as aq, matchKey as ar, matchSpec as as, matchesGuard as at, nameId as au, one as av, outPlace as aw, outputArc as ax, passthrough as ay, place as az, Transition as b, type TokenSupplier as b0, type Unknown as b1, type Unreachable as b2, type Verdict as b3, type Violated as b4, branchPlaceBound as b5, deadlockFree as b6, isProven as b7, isViolated as b8, joinedOrDeadLettered as b9, mutualExclusion as ba, pInvariant as bb, pInvariantToString as bc, placeBound as bd, propertyDescription as be, unreachable as bf, TransitionContext as c, type ArcInhibitor as d, type ArcInput as e, type ArcOutput as f, type ArcRead as g, type ArcReset as h, ComposeBindings as i, FusionSetBuilder as j, type InAll as k, type InAtLeast as l, type InExactly as m, type InOne as n, Instance as o, Interface as p, InterfaceBuilder as q, type MatchKey as r, type MatchSpec as s, type OutAnd as t, type OutForwardInput as u, type OutPlace as v, type OutTimeout as w, type OutXor as x, type OutputEntry as y, PetriNetBuilder as z };
+export { type VerificationHarness as $, type Arc as A, type Port as B, type Channel as C, type PortDirection as D, type EnvironmentPlace as E, FusionSet as F, SubnetDefBuilder as G, type SubnetInstance as H, type In as I, type Timing as J, type KeyFn as K, type LogFn as L, MAX_DURATION_MS as M, type NameId as N, type Out as O, PetriNet as P, type TimingDeadline as Q, type TimingDelayed as R, SubnetDef as S, type Token as T, type TimingExact as U, type TimingImmediate as V, type TimingWindow as W, TokenInput as X, TokenOutput as Y, type TransitionAction as Z, TransitionBuilder as _, type Place as a, type Unknown as a$, type VerificationResult as a0, all as a1, allPlaces as a2, and as a3, andPlaces as a4, arcPlace as a5, atLeast as a6, consumptionCount as a7, deadline as a8, delayed as a9, requiredCount as aA, resetArc as aB, timeout as aC, timeoutPlace as aD, tokenAt as aE, tokenOf as aF, transform as aG, transformAsync as aH, transformFrom as aI, unitToken as aJ, window as aK, withTimeout as aL, xor as aM, xorPlaces as aN, MarkingState as aO, type PInvariant as aP, MarkingStateBuilder as aQ, type SmtProperty as aR, type SmtVerificationResult as aS, type BranchPlaceBound as aT, type DeadlockFree as aU, type JoinedOrDeadLettered as aV, type MutualExclusion as aW, type PlaceBound as aX, type Proven as aY, type SmtStatistics as aZ, type TokenSupplier as a_, earliest as aa, enumerateBranches as ab, environmentPlace as ac, exact as ad, exactly as ae, fork as af, forwardInput as ag, hasDeadline as ah, immediate as ai, inhibitorArc as aj, inputArc as ak, isPassthrough as al, isUnit as am, keyForPlace as an, latest as ao, matchCorrelates as ap, matchKey as aq, matchSpec as ar, nameId as as, one as at, outPlace as au, outputArc as av, passthrough as aw, place as ax, produce as ay, readArc as az, Transition as b, type Unreachable as b0, type Verdict as b1, type Violated as b2, branchPlaceBound as b3, deadlockFree as b4, isProven as b5, isViolated as b6, joinedOrDeadLettered as b7, mutualExclusion as b8, pInvariant as b9, pInvariantToString as ba, placeBound as bb, propertyDescription as bc, unreachable as bd, TransitionContext as c, type ArcInhibitor as d, type ArcInput as e, type ArcOutput as f, type ArcRead as g, type ArcReset as h, ComposeBindings as i, FusionSetBuilder as j, type InAll as k, type InAtLeast as l, type InExactly as m, type InOne as n, Instance as o, Interface as p, InterfaceBuilder as q, type MatchKey as r, type MatchSpec as s, type OutAnd as t, type OutForwardInput as u, type OutPlace as v, type OutTimeout as w, type OutXor as x, type OutputEntry as y, PetriNetBuilder as z };

package/dist/verification/index.d.ts

@@ -1,5 +1,5 @@
-import { b as Transition, a as Place, P as PetriNet, E as EnvironmentPlace, aQ as MarkingState, aR as PInvariant, aS as MarkingStateBuilder, aT as SmtProperty, aU as SmtVerificationResult } from '../petri-net-C3LSY-vm.js';
-export { aV as BranchPlaceBound, aW as DeadlockFree, aX as JoinedOrDeadLettered, aY as MutualExclusion, aZ as PlaceBound, a_ as Proven, a$ as SmtStatistics, b0 as TokenSupplier, b1 as Unknown, b2 as Unreachable, b3 as Verdict, $ as VerificationHarness, a0 as VerificationResult, b4 as Violated, b5 as branchPlaceBound, b6 as deadlockFree, b7 as isProven, b8 as isViolated, b9 as joinedOrDeadLettered, ba as mutualExclusion, bb as pInvariant, bc as pInvariantToString, bd as placeBound, be as propertyDescription, bf as unreachable } from '../petri-net-C3LSY-vm.js';
+import { b as Transition, a as Place, P as PetriNet, E as EnvironmentPlace, aO as MarkingState, aP as PInvariant, aQ as MarkingStateBuilder, aR as SmtProperty, aS as SmtVerificationResult } from '../petri-net-UQBBkvLl.js';
+export { aT as BranchPlaceBound, aU as DeadlockFree, aV as JoinedOrDeadLettered, aW as MutualExclusion, aX as PlaceBound, aY as Proven, aZ as SmtStatistics, a_ as TokenSupplier, a$ as Unknown, b0 as Unreachable, b1 as Verdict, $ as VerificationHarness, a0 as VerificationResult, b2 as Violated, b3 as branchPlaceBound, b4 as deadlockFree, b5 as isProven, b6 as isViolated, b7 as joinedOrDeadLettered, b8 as mutualExclusion, b9 as pInvariant, ba as pInvariantToString, bb as placeBound, bc as propertyDescription, bd as unreachable } from '../petri-net-UQBBkvLl.js';
 import { Expr, init, Bool, FuncDecl } from 'z3-solver';
 
 /**
@@ -341,9 +341,10 @@ type PrioritySemantics = 'none' | 'conflict';
  * - Operates on the marking projection (integer vectors) — no timing
  * - An untimed deadlock-freedom proof is stronger than needed
  *   (timing can only restrict behavior)
- * - Guards are ignored — over-approximation is sound for safety properties
- * - If a counterexample is found, it may be spurious in timed/guarded
- *   semantics — the report notes this
+ * - Input specifications are purely structural (IO-006) — there is no per-arc
+ *   predicate for the encoder to be blind to
+ * - If a counterexample is found, it may be spurious in timed semantics —
+ *   the report notes this
  *
  * Verification Pipeline:
  * 1. Flatten — expand XOR, index places, build pre/post vectors

package/dist/verification/index.js

@@ -35,7 +35,7 @@ import {
   propertyDescription,
   structuralCheck,
   unreachable
-} from "../chunk-7VJ5CYUU.js";
+} from "../chunk-5W6SVYPD.js";
 import "../chunk-ATT7U5H5.js";
 
 // src/verification/analysis/scc-analyzer.ts

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "libpetri",
-  "version": "2.13.0",
+  "version": "3.0.0",
   "description": "Coloured Time Petri Net engine — TypeScript port",
   "homepage": "https://libpetri.org",
   "repository": {