
On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets
We study the computational complexity of the Escape Problem for discrete...
read it

On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices
We investigate the complexity of computing the Zariski closure of a fini...
read it

Porous Invariants
We introduce the notion of porous invariants for multipath (or branching...
read it

The Orbit Problem for Parametric Linear Dynamical Systems
We study a parametric version of the KannanLipton Orbit Problem for lin...
read it

Deciding ωRegular Properties on Linear Recurrence Sequences
We consider the problem of deciding ωregular properties on infinite tra...
read it

Cyclotomic Identity Testing and Applications
We consider the cyclotomic identity testing (CIT) problem: given a polyn...
read it

On Positivity and Minimality for SecondOrder Holonomic Sequences
An infinite sequence ⟨u_n⟩_n∈ℕ of real numbers is holonomic (also known ...
read it

On LTL Model Checking for LowDimensional Discrete Linear Dynamical Systems
Consider a discrete dynamical system given by a square matrix M ∈ℚ^d × d...
read it

On the Skolem Problem and Prime Powers
The Skolem Problem asks, given a linear recurrence sequence (u_n), wheth...
read it

Invariants for Continuous Linear Dynamical Systems
Continuous linear dynamical systems are used extensively in mathematics,...
read it

On the Hardness of Robust Classification
It is becoming increasingly important to understand the vulnerability of...
read it

On the Monniaux Problem in Abstract Interpretation
The Monniaux Problem in abstract interpretation asks, roughly speaking, ...
read it

Algebraic Invariants for Linear Hybrid Automata
We exhibit an algorithm to compute the strongest algebraic (or polynomia...
read it

On reachability problems for low dimensional matrix semigroups
We consider the Membership and the Halfspace Reachability Problems for ...
read it

Termination of Linear Loops over the Integers
We consider the problem of deciding termination of singlepath while loo...
read it

On Termination of Integer Linear Loops
We consider the problem of determining termination of singlepath loops ...
read it

Coverability in 1VASS with Disequality Tests
We show that the controlstate reachability problem for onedimensional ...
read it

The Semialgebraic Orbit Problem
The Semialgebraic Orbit Problem is a fundamental reachability question t...
read it

Effective Divergence Analysis for Linear Recurrence Sequences
We study the growth behaviour of rational linear recurrence sequences. W...
read it

On the Expressiveness and Monitoring of Metric Temporal Logic
It is known that Metric Temporal Logic (MTL) is strictly less expressive...
read it

Costs and Rewards in Priced Timed Automata
We consider Pareto analysis of reachable states of multipriced timed au...
read it

OMinimal Invariants for Linear Loops
The termination analysis of linear loops plays a key role in several are...
read it

On the Decidability of Reachability in Linear TimeInvariant Systems
We consider the decidability of statetostate reachability in linear ti...
read it

Polynomial Invariants for Affine Programs
We exhibit an algorithm to compute the strongest polynomial (or algebrai...
read it

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
We study the bisimilarity problem for probabilistic pushdown automata (p...
read it

Semialgebraic Invariant Synthesis for the KannanLipton Orbit Problem
The Orbit Problem consists of determining, given a linear transformation...
read it
James Worrell
is this you? claim profile