Zeno, Hercules, and the Hydra
From MaRDI portal
Publication:5277917
DOI10.1145/2874774zbMath1367.68109OpenAlexW2280377303WikidataQ130870016 ScholiaQ130870016MaRDI QIDQ5277917
Joël Ouaknine, Ranko Lazić, James Worrell
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2874774
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sooner is safer than later
- Using forward reachability analysis for verification of lossy channel systems
- Unreliable channels are easier to verify than perfect channels
- On termination and invariance for faulty channel machines
- Complexity Hierarchies beyond Elementary
- Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian
- Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
- Accessible Independence Results for Peano Arithmetic
- Demystifying Reachability in Vector Addition Systems
- The Parametric Ordinal-Recursive Complexity of Post Embedding Problems
- On the decidability and complexity of Metric Temporal Logic over finite words
- CONCUR 2004 - Concurrency Theory
- Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
- Hierarchies of number-theoretic functions. I
- Tools and Algorithms for the Construction and Analysis of Systems
- Foundations of Software Science and Computation Structures
- Long finite sequences
- Well-structured transition systems everywhere!
This page was built for publication: Zeno, Hercules, and the Hydra
