Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
From MaRDI portal
Recommendations
- An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations
- An iterative algorithm of computing the transitive closure of a union of parametrized affine integer tuple relations
- Calculating exact transitive closure for a normalized affine integer tuple relation
- PTIME computation of transitive closures of octagonal relations
- Fast acceleration of ultimately periodic relations
Cited in
(10)- PTIME computation of transitive closures of octagonal relations
- Using basis dependence distance vectors in the modified Floyd-Warshall algorithm
- Calculating exact transitive closure for a normalized affine integer tuple relation
- Using basis dependence distance vectors to calculate the transitive closure of dependence relations by means of the Floyd-Warshall algorithm
- An iterative algorithm of computing the transitive closure of a union of parametrized affine integer tuple relations
- An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations
- scientific article; zbMATH DE number 4200238 (Why is no real title available?)
- Fast acceleration of ultimately periodic relations
- Applying abstract acceleration to (co-)reachability analysis of reactive programs
- Convex invariant refinement by control node splitting: a heuristic approach
This page was built for publication: Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637054)