Verifying linear temporal properties on polyhedral systems: decidability and symbolic algorithms

DOI10.1016/J.IC.2026.105453MaRDI QIDQ7286056zbMATH OpenFDO

Authors Massimo Benerecetti, Marco Faella, Fabio Mogavero

Publication date 23 June 2026

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2026.105453

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications
• A theory of timed automata
• Automata-theoretic techniques for modal logics of programs
• Automatic synthesis of switching controllers for linear hybrid systems: safety control
• Checking Temporal Properties of Discrete, Timed and Continuous Behaviors
• Flat fragments of CTL and CTL: separating the expressive and distinguishing powers
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• From Spot 2.0 to Spot 2.10: What’s New?
• Incremental convex hull algorithms are not output sensitive
• Optimal scheduling for constant-rate multi-mode systems
• The benefits of relaxing punctuality
• The complexity of temporal logic over the reals
• Verifying linear temporal specifications of constant-rate multi-mode systems
• What's decidable about hybrid automata?

This page was built for publication: Verifying linear temporal properties on polyhedral systems: decidability and symbolic algorithms

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