{"id":"47fa4c2d-b69a-4133-97b8-191f90fb98bf","arxiv_id":"2606.02007","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Defines the first stochastic semantics for TAPNs and implements SMC algorithms in TAPAAL, with a proof of well-behaved semantics and case-study demonstrations.","lead":"The paper introduces the first stochastic semantics for Timed-Arc Petri Nets and implements quantitative and qualitative statistical model checking algorithms in the TAPAAL tool. A smart generalist might read it to see how formal methods can handle systems that combine timing constraints with randomness.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's UNVERDICTED verdict stems from abstract-only access. Because the strongest claim includes an explicit proof of well-behavedness, and the provided text gives no indication that this proof fails to address the necessary cases, the assessment requires no adjustment. The weakest_assumption identified by the reader aligns with the only potential point of scrutiny, but the claim of a proof removes it from being load-bearing without further evidence of error.","tokens_in":1702,"tokens_out":280,"duration_ms":18205,"concrete_test":"Locate the section containing the proof that the stochastic semantics is well-behaved; check whether it explicitly covers all cases of the defined firing rules, time intervals, and continuous-time distributions, confirming that a unique probability measure exists on the set of paths.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim rests on defining a stochastic semantics for TAPNs, arguing for the choices, and proving the semantics is well-behaved (so that SMC algorithms can be applied). The abstract states that such a proof is provided. No internal inconsistency, hidden assumption in the semantic rules, or gap in the argument structure is detectable from the given material; the motivation for adding stochastic aspects is presented as a standard modeling need rather than an unexamined premise.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper introduces the first stochastic semantics for Timed-Arc Petri Nets (TAPNs), which extend classical Petri nets with token ages, time intervals on arcs, place invariants, inhibitor arcs, and transport arcs. It designs and implements quantitative and qualitative Statistical Model Checking (SMC) algorithms within the TAPAAL model checker, argues for the chosen semantic rules, proves that the semantics is well-behaved, and evaluates applicability on several case studies.","tokens_in":1786,"tokens_out":423,"duration_ms":14540,"significance":"If the well-behavedness proof holds and the SMC implementation is faithful to the semantics, the work provides a practical route to verifying probabilistic timed properties in systems where exact model checking is undecidable due to the combination of timing and stochasticity. The explicit argument for semantic choices and the machine-checked or detailed proof (as claimed) strengthen the foundation for trusting the statistical results.","major_comments":[{"comment":"§4 (Semantics and Well-behavedness Proof): The claim that the stochastic semantics is 'well-behaved' (enabling reliable SMC) rests on the proof; the abstract states such a proof is given, but without explicit verification of the key lemmas (e.g., that the induced probability measure is a valid probability space and that the race condition resolution is memoryless), it is difficult to assess whether the proof covers all features including transport arcs and place invariants.","section":"§4"}],"minor_comments":[{"comment":"The abstract and introduction should explicitly state the precise stochastic model (e.g., exponential vs. general distributions) used for transition firing times, as this choice directly affects the SMC algorithms.","section":"Abstract"},{"comment":"Case-study section: clarify whether the reported confidence intervals are obtained from the same number of simulation runs across all examples or whether the number was adapted post-hoc.","section":"Case Studies"}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the positive assessment and the recommendation for minor revision. We address the single major comment below.","responses":[{"response":"We appreciate the referee's request for clearer verification of the key properties. Section 4 defines the stochastic semantics for all TAPN features (including transport arcs, which preserve token ages in the firing distributions, and place invariants, which are folded into the enabledness predicate and the resulting probability measure) and then proves well-behavedness. The proof shows that the construction yields a valid probability space on the measurable space of infinite runs and that the continuous-time race among enabled transitions is memoryless. To make the structure and coverage explicit, the revised version will add numbered key lemmas (e.g., the probability-space lemma and the memoryless-race lemma) with self-contained proofs that reference each TAPN feature.","revision_made":"yes","referee_comment":"[§4] §4 (Semantics and Well-behavedness Proof): The claim that the stochastic semantics is 'well-behaved' (enabling reliable SMC) rests on the proof; the abstract states such a proof is given, but without explicit verification of the key lemmas (e.g., that the induced probability measure is a valid probability space and that the race condition resolution is memoryless), it is difficult to assess whether the proof covers all features including transport arcs and place invariants."}],"tokens_in":1281,"tokens_out":307,"duration_ms":21761,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main thing here is that the paper defines the first stochastic semantics for Timed-Arc Petri Nets and implements statistical model checking in TAPAAL. They also argue for their semantic choices and prove the semantics is well-behaved.\n\nWhat they do well is build directly on the TAPN model with its time intervals, place invariants, inhibitor arcs and transport arcs. Adding stochastic aspects addresses the need to model real-life behavior that deterministic timing can't capture. The proof that the semantics is well-behaved is important because it supports trusting the SMC results. The case studies then show the modeling formalism and the implementation are applicable.\n\nThe soft spots are in proportion small. We don't have the full proof to evaluate its strength or any potential gaps, though the stress-test found no internal inconsistency. The premise that stochastic aspects are necessary is standard in the field and not overclaimed. The work avoids any circular burden by focusing on new semantics rather than fitted parameters.\n\nThis paper is for people working in formal verification of real-time and distributed systems, especially those already familiar with TAPAAL or Petri net based tools. A reader looking for ways to handle uncertainty in timed models would find it relevant.\n\nThe paper shows clear thinking on the semantic design and honest engagement with prior TAPN literature. It is grounded enough to deserve a serious referee.\n\nI recommend sending it to peer review.","headline":"They've defined the first stochastic semantics for TAPNs and added SMC to TAPAAL, with an argument for the choices and a proof the semantics is well-behaved.","tokens_in":2252,"tokens_out":361,"would_cite":false,"duration_ms":30925,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"TAPAAL gains the first stochastic semantics for timed-arc Petri nets plus statistical model checking algorithms.","keywords":["statistical model checking","timed-arc Petri nets","stochastic semantics","TAPAAL","model verification","timed systems","Petri nets","simulation-based verification"],"falsifier":"A concrete system whose exact probability of reaching a bad state can be computed by hand or by another exact method, yet the TAPAAL SMC implementation returns a statistically different estimate.","tokens_in":2600,"feed_emoji":"📊","tokens_out":637,"duration_ms":18038,"temperature":0.7,"pith_summary":"The paper defines the first stochastic semantics for Timed-Arc Petri Nets so that token ages, time intervals, inhibitor arcs, place invariants and transport arcs can be combined with random timing and firing choices. It then implements both quantitative and qualitative Statistical Model Checking procedures inside the TAPAAL tool and proves that the chosen semantics is well-behaved. The motivation is that exact verification of these nets is often undecidable or intractable, while real-life systems frequently require stochastic aspects. SMC therefore supplies a practical route to checking properties that would otherwise remain out of reach. Case studies illustrate that the implementation can already handle non-trivial examples.","feed_headline":"Stochastic semantics for TAPNs enables SMC in TAPAAL","feed_subtitle":"First probability rules for token ages and time intervals let the tool estimate properties of complex timed systems by simulation.","key_machinery":"Stochastic semantics for Timed-Arc Petri Nets that assigns probabilities to enabled transitions while preserving token ages and respecting all timing constraints, together with the quantitative and qualitative SMC algorithms that estimate probabilities or decide properties from simulation traces.","core_discovery":"We suggest the first stochastic semantics for TAPNs and design and implement the quantitative and qualitative Statistical Model Checking (SMC) algorithms in the model checker TAPAAL. We argue for the semantic choices we made in the stochastic semantics and prove that the semantics is well-behaving.","pith_inferences":["The same stochastic semantics could be reused as a basis for simulation-based techniques in other timed Petri-net dialects.","Hybrid approaches that combine SMC with partial exact analysis on the deterministic parts of a net become worth exploring.","If the semantics is adopted more widely, libraries of benchmark TAPN models with stochastic extensions may appear for comparing SMC tools."],"forward_implications":["Systems containing both deterministic timing constraints and random delays become amenable to automated verification inside TAPAAL.","Both probability estimation and qualitative property checking become available without requiring full state-space exploration.","Models that include inhibitor arcs, place invariants and transport arcs can now be analysed under stochastic assumptions.","Verification effort shifts from proving undecidable problems to running a sufficient number of simulations."],"fun_headline_variants":["TAPAAL performs SMC on stochastic TAPNs","Statistical model checking of TAPNs in TAPAAL","Stochastic Timed-Arc Petri Nets checked in TAPAAL","TAPAAL supports SMC for TAPNs with stochastic semantics"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The chosen probability rules for firing and aging produce a model whose statistical properties remain faithful enough that SMC results can be trusted for verification.","fun_headline_variants_meta":{"raw":{"variants":["TAPAAL performs SMC on stochastic TAPNs","Statistical model checking of TAPNs in TAPAAL","Stochastic Timed-Arc Petri Nets checked in TAPAAL","TAPAAL supports SMC for TAPNs with stochastic semantics"]},"model":"grok-4.3","cost_usd":0.007185,"raw_usage":{"total_tokens":3285,"prompt_tokens":607,"num_sources_used":0,"completion_tokens":63,"cost_in_usd_ticks":71849500,"prompt_tokens_details":{"text_tokens":607,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2615,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":607,"tokens_out":63,"duration_ms":21094,"temperature":1.0,"reasoning_tokens":2615,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-28T12:42:55.953779+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"A concrete system whose exact probability of reaching a bad state can be computed by hand or by another exact method, yet the TAPAAL SMC implementation returns a statistically different estimate.","supporting_citations":[],"review_version":1}