The Well Structured Problem for Presburger Counter Machines

DOI10.4230/LIPIcs.FSTTCS.2019.41OpenAlexW4393108178MaRDI QIDQ5875677

Ekanshdeep Gupta, Alain Finkel

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1910.02736

zbMATH Keywords

reachabilityinfinite state systemscoverabilitywell structured transition systemsPresburger counter machines

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Related Items

Unnamed Item