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 >

Categories

UML, Scientific/Engineering, Libraries

License

GNU General Public License version 3.0 (GPLv3)

Follow Alternating Timed Automata Solver

Alternating Timed Automata Solver Web Site

You Might Also Like
Total Network Visibility for Network Engineers and IT Managers Icon
Total Network Visibility for Network Engineers and IT Managers

Network monitoring and troubleshooting is hard. TotalView makes it easy.

This means every device on your network, and every interface on every device is automatically analyzed for performance, errors, QoS, and configuration.
Learn More
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

Italian, English

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
Report inappropriate content