Our goal is to develop a full working solver for ATA (with 1 clock) in Python, with MTL to ATA support. The decidability for the emptiness problem was proposed by Lasota and Walukiewicz. The MTL to ATA was proposed by Ouaknine and Worrell.
Features
- Alternating Timed Automata emptiness solver
- MTL to ATA translation
- Common ATA operations (Union, Complementation, Intersection, Model checking)
License
GNU General Public License version 3.0 (GPLv3)Follow Alternating Timed Automata Solver
Other Useful Business Software
Ship AI Apps Faster with Vertex AI
Ship AI apps and features faster with Vertex AI—your end-to-end AI platform. Access Gemini 3 and 200+ foundation models, fine-tune for your needs, and deploy with enterprise-grade MLOps. Build chatbots, agents, or custom models. New customers get $300 in free credit.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Alternating Timed Automata Solver!