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
Veeam Data Platform v13.1 - Get Your Free Trial
Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Alternating Timed Automata Solver!