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)

Project Activity

See All Activity >

License

GNU General Public License version 3.0 (GPLv3)

Follow Alternating Timed Automata Solver

Alternating Timed Automata Solver Web Site

Other Useful Business Software
Ship AI Apps Faster with Vertex AI Icon
Ship AI Apps Faster with Vertex AI

Go from idea to deployed AI app without managing infrastructure. Vertex AI offers one platform for the entire AI development lifecycle.

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.
Try Vertex AI Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Alternating Timed Automata Solver!

Additional Project Details

Languages

English, Italian

Intended Audience

Information Technology

User Interface

Qt

Programming Language

Python

Database Environment

XML-based

Related Categories

Python UML Tool, Python Scientific Engineering, Python Libraries

Registered

2010-02-04