Porous invariants for linear systems
From MaRDI portal
Cites work
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- About the decision of reachability for register machines
- Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
- Affine relationships among variables of a program
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Automated Technology for Verification and Analysis
- Bounded Algol-Like Languages
- Decision problems for linear recurrence sequences
- Ein Verfahren zur Behandlung gewisser exponentialer Gleichungen und diophantischer Gleichungen.
- Fast acceleration of ultimately periodic relations
- scientific article; zbMATH DE number 3056890 (Why is no real title available?)
- On the complexity of the orbit problem
- On the decidability of the existence of polyhedral invariants in transition systems
- On the Monniaux problem in abstract interpretation
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Polynomial Invariants for Affine Programs
- Polynomial-time algorithm for the orbit problem
- Porous invariants
- Reachability in register machines with polynomial updates
- The general vector addition system reachability problem by Presburger inductive invariants
- The polyhedron-hitting problem
- Undecidability of infinite Post correspondence problem for instances of size 8
- Undecidability of infinite post correspondence problem for instances of Size 9
- Vector addition system reachability problem, a short self-contained proof
- Zwei Sätze über Gleichungen mit ganzzahligen Coefficienten.
This page was built for publication: Porous invariants for linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632205)
