GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic

Tsay, Yih-Kuen; Chen, Yu‐Fang; Tsai, Ming-Hsien; Chan, Wen S.; Luo, Chi-Jian

doi:10.1007/978-3-540-78800-3_26

Cited by 17 publications

(22 citation statements)

References 16 publications

(22 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Emptiness of this deterministic parity automaton can then be checked using parity games with three priorities. Synthesis tools have been implemented that employ parity games internally, most notably GOAL [75] and Gist [16]. All synthesis tools that we are aware of, however, are research quality tools, of which we have not been able to obtain working versions on current computing platforms.…”

Section: Encodingsmentioning

confidence: 99%

Benchmarks for Parity Games

Keiren

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We propose a benchmark suite for parity games that includes the benchmarks that have been used in the literature, and make it available online. We give an overview of the parity games, including a description of how they have been generated. We also describe structural properties of parity games, and using these properties we show that our benchmarks are representative. With this work we provide a starting point for further experimentation with parity games.

show abstract

Section: Encodingsmentioning

confidence: 99%

Benchmarks for Parity Games

Keiren

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This is because tool support for Streett complementation is nonexistent. To the best of our knowledge, the only tool for the complementation of ω-automata is GOAL [17], which currently supports Büchi automata but not SAs.…”

Section: Lemma 12 Let C Be the Uclts (S A C Rŝ) Then Thementioning

confidence: 99%

Introducing Fairness into Compositional Verification via Unidirectional Counters

Siirtola

Puhakka²,

Lüttgen

2012

2012 12th International Conference on Application of Concurrency to System Design

View full text Add to dashboard Cite

Abstract-We equip labelled transition systems (LTSs) with unidirectional counters (UCs) which can be initialised to an arbitrary positive value and decremented but not incremented. This formalism, called UCLTSs, enables one to express fairness properties of concurrent systems in a finite form and reason about them in a compositional, refinement-based fashion. Technically, we first show how to apply CSP-style parallel composition and hiding directly on UCLTSs while maintaining compositionality. As our main result, we prove that the refinement checking of UCLTSs under the chaos-free failuresdivergences semantics can be reduced to two decidable tasks that can be solved by the popular FDR2 and NuSMV model checkers, respectively.

show abstract

“…Specifically, as stated in Proposition 2, the number of states in the product automaton grows exponentially with the number of control loops. For example, with the seventeen loops present in the Mineral Flotation Control case study, the computation of the product automaton is not practical with direct application of current versions of tools such as GOAL [12], JFLAP [13], and SPIN [14].…”

Section: A Mathematica Notebook For Scheduling the Mineral Floatatmentioning

confidence: 99%

Scalable scheduling algorithms for wireless networked control systems

D’Innocenzo

Weiss

Alur

et al. 2009

2009 IEEE International Conference on Automation Science and Engineering

View full text Add to dashboard Cite

Abstract-In this paper, we address the problem of designing scalable scheduling and routing policies over a time-triggered multi-hop control network, when closing a considerable number of control loops on the same network. The key idea is to formally define by means of regular languages the set of schedules for each control loop that satisfy a given control specification, and to exploit operators on regular languages to compute the set of schedules for the whole system. In order to test our methodology, we address a mineral floatation control problem derived from the Boliden (a swedish mining company) mine in Garpenberg, and propose a scheduling solution that can be implemented on systems compliant with communication protocols for wireless networks (e.g. the WirelessHART specification).

show abstract

GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic

Cited by 17 publications

References 16 publications

Benchmarks for Parity Games

Benchmarks for Parity Games

Introducing Fairness into Compositional Verification via Unidirectional Counters

Scalable scheduling algorithms for wireless networked control systems

Contact Info

Product

Resources

About