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
$300 Free Credits to Build on Google Cloud Icon
$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
Start 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