The complexity of linear temporal verification for continuous counter systems

DOI10.1145/3769868MaRDI QIDQ6877845zbMATH OpenFDO

Authors Michael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan

Publication date 7 January 2026

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3769868

zbMATH Keywords

complexityconstant-rate multi-mode systemcontinuous Petri netlinear temporal logicLTLmmsVASvector addition system

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• An SMT-based approach to coverability analysis
• Bounded-rate multi-mode systems based motion planning
• Complexity analysis of continuous Petri nets
• Deterministic generators and games for LTL fragments
• Directed reachability for infinite-state systems
• Global Almost-Sure Reachability in Stochastic Constant-Rate Multi-Mode Systems
• scientific article; zbMATH DE number 2102690 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• Logics for continuous reachability in Petri nets and vector addition systems with states
• On strong NP-completeness of rational problems
• Optimal scheduling for constant-rate multi-mode systems
• Reachability in Petri nets with inhibitor arcs
• Reasoning about systems with many processes
• The complexity of propositional linear temporal logics
• The complexity of propositional linear temporal logics in simple cases
• The Reach-Avoid Problem for Constant-Rate Multi-mode Systems
• Verification of population protocols
• Weak singular hybrid automata

This page was built for publication: The complexity of linear temporal verification for continuous counter systems

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