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
Forever Free Full-Stack Observability | Grafana Cloud Icon
Forever Free Full-Stack Observability | Grafana Cloud

Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
Create free account
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