The Well Structured Problem for Presburger Counter Machines

DOI10.4230/LIPICS.FSTTCS.2019.41MaRDI QIDQ5875677zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(4)

• Branch-well-structured transition systems and extensions
• An efficient quantifier elimination procedure for Presburger arithmetic
• scientific article; zbMATH DE number 7453189 (Why is no real title available?)
• On the termination and structural termination problems for counter machines with incrementing errors

This page was built for publication: The Well Structured Problem for Presburger Counter Machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875677)