Petri nets: an introduction
Termination detection in logic programs using argument sizes (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Recursion theory
Undecidability of bisimilarity for Petri nets and some related problems
STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
The size-change principle for program termination
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deciding stability and mortality of piecewise affine dynamical systems
Theoretical Computer Science
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Synthesis of Linear Ranking Functions
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
TermiLog: A System for Checking Termination of Queries to Logic Programs
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
DECIDABILITY QUESTIONS FOR PETRI NETS
DECIDABILITY QUESTIONS FOR PETRI NETS
Computation: finite and infinite machines
Computation: finite and infinite machines
Termination analysis of integer linear loops
CONCUR 2005 - Concurrency Theory
Termination proofs for systems code
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Program termination analysis in polynomial time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination analysis of logic programs through combination of type-based norms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Recurrence with affine level mappings is p-time decidable for clp$({\mathbb r})$
Theory and Practice of Logic Programming
Size-change termination with difference constraints
ACM Transactions on Programming Languages and Systems (TOPLAS)
A termination analyzer for Java bytecode based on path-length
ACM Transactions on Programming Languages and Systems (TOPLAS)
The undecidability of the generalized Collatz problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A SAT-based approach to size change termination with global ranking functions
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Automated termination proofs for haskell by term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
Testing for termination with monotonicity constraints
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Termination of integer linear programs
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
On the termination of integer loops
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Verification of gap-order constraint abstractions of counter systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
A new look at the automatic synthesis of linear ranking functions
Information and Computation
Deciding conditional termination
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
The orbit problem in higher dimensions
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Eventual linear ranking functions
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Hi-index | 0.00 |
In this article we study the decidability of termination of several variants of simple integer loops, without branching in the loop body and with affine constraints as the loop guard (and possibly a precondition). We show that termination of such loops is undecidable in some cases, in particular, when the body of the loop is expressed by a set of linear inequalities where the coefficients are from Z ∪ {r} with r an arbitrary irrational; when the loop is a sequence of instructions, that compute either linear expressions or the step function; and when the loop body is a piecewise linear deterministic update with two pieces. The undecidability result is proven by a reduction from counter programs, whose termination is known to be undecidable. For the common case of integer linear-constraint loops with rational coefficients we have not succeeded in proving either decidability or undecidability of termination, but we show that a Petri net can be simulated with such a loop; this implies some interesting lower bounds. For example, termination for a partially specified input is at least EXPSPACE-hard.