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
Get Avast Free Antivirus | Your top-rated shield against malware and online scams
Our antivirus software scans for security and performance issues and helps you to fix them instantly. It also protects you in real time by analyzing unknown files before they reach your desktop PC or laptop — all for free.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Alternating Timed Automata Solver!