Complementing deterministic Bu¨chi automata in polynomial time
Journal of Computer and System Sciences
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
A hierarchy of temporal properties (invited paper, 1989)
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Verification by augmented finitary abstraction
Information and Computation
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Complementation of Büchi Automata Revised
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On-the-Fly Verification of Linear Temporal Logic
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Decision Algorithm for Full Propositional Temporal Logic
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Environment Synthesis for Compositional Model Checking
ICCD '02 Proceedings of the 2002 IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD'02)
Automata logics, and infinite games
Memoryless determinacy of parity games
Automata logics, and infinite games
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
SIAM Journal on Computing
Observations on determinization of Büchi automata
Theoretical Computer Science - Implementation and application of automata
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Complementation, Disambiguation, and Determinization of Büchi Automata Unified
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
RTComposer: a framework for real-time components with scheduling interfaces
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Co-ing Büchi Made Tight and Useful
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Minimal Büchi Automata for Certain Classes of LTL Formulas
DEPCOS-RELCOMEX '09 Proceedings of the 2009 Fourth International Conference on Dependability of Computer Systems
A Deterministic Subexponential Algorithm for Solving Parity Games
SIAM Journal on Computing
Solving Parity Games in Practice
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
GOAL: a graphical tool for manipulating Büchi automata and temporal formulae
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Solving parity games in big steps
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
GOAL extended: towards a research tool for omega automata and temporal logic
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
State of büchi complementation
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
QUASY: quantitative synthesis tool
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Simulation subsumption in ramsey-based büchi automata universality and inclusion testing
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
| Hi-index | 0.00 |
This paper introduces the second generation of GOAL, which is a graphical interactive tool for games, ω-automata, and logics. It is a complete redesign with an extensible architecture, many enhancements to existing functions, and new features. The extensible architecture allows easy integration of third-party plugins. The enhancements provide more automata conversion, complementation, simplification, and testing algorithms, translation of full QPTL formulae, and better automata navigation with more layout algorithms and utility functions. The new features include game solving, manipulation of two-way alternating automata, translation of ACTL formulae and ω-regular expressions, test of language star-freeness, classification of ω-regular languages into the temporal hierarchy of Manna and Pnueli, and a script interpreter.