FOMOD is constant-time testable on bounded-degree bounded-component-size graphs by tailoring Hanf normal form and using a number-theoretic patchability condition to combine local samples into global information.
Hanf normal form for first-order logic with unary counting quantifiers
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
method 1polarities
use method 1representative citing papers
Introduces parametric Markov Automata and a two-step discretization approach to pMDPs that computes bounds on time-bounded reachability probabilities up to arbitrary precision.
Statistical model checking reproduces key stylized facts of the Island Model with confidence intervals, confirms moderate exploration rates are optimal, and enables counterfactual sensitivity analysis across parameters.
citing papers explorer
-
Constant time testability of first-order logic with modulo counting on finitary graphs
FOMOD is constant-time testable on bounded-degree bounded-component-size graphs by tailoring Hanf normal form and using a number-theoretic patchability condition to combine local samples into global information.
-
Verification of Parametric Markov Automata under Time-bounded Reachability
Introduces parametric Markov Automata and a two-step discretization approach to pMDPs that computes bounds on time-bounded reachability probabilities up to arbitrary precision.
-
Statistical Model Checking of the Island Model: An Established Economic Agent-Based Model of Endogenous Growth
Statistical model checking reproduces key stylized facts of the Island Model with confidence intervals, confirms moderate exploration rates are optimal, and enables counterfactual sensitivity analysis across parameters.