Improving parity games in practice
type: Item
instance of: scholarly article
title: Improving parity games in practice
author: Antonio Di Stasio
author: Aniello Murano
author: Vincenzo Prignano
author: Loredana Sorrentino
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2021-08-02T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 7377237
zbMATH Keywords: formal verification
zbMATH Keywords: Zielonka recursive algorithm
zbMATH Keywords: PGSolver
describes a project that uses: Scala
describes a project that uses: OCaml
describes a project that uses: PGSolver
describes a project that uses: Oink
MaRDI profile type: Publication
full work available at URL: s10472-020-09721-3
OpenAlex ID: W3123479446
cites work: Improved model checking of hierarchical systems
cites work: Graded modalities in strategy logic
cites work: Polynomial-Time Under-Approximation of Winning Regions in Parity Games
cites work: Solving Parity Games via Priority Promotion
cites work: Admissibility in Infinite Games
cites work: Deciding parity games in quasipolynomial time
cites work: Q5501249
cites work: Generalized mean-payoff and energy games
cites work: Q3336675
cites work: Q5227061
cites work: A pseudo-quasi-polynomial algorithm for mean-payoff parity games
cites work: Solving Parity Games Using an Automata-Based Algorithm
cites work: Solving parity games: explicit vs symbolic
cites work: Solving Parity Games in Practice
cites work: Solving Parity Games on the GPU
cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
cites work: Q4501540
cites work: Q5144638
cites work: A Deterministic Subexponential Algorithm for Solving Parity Games
cites work: Results on the propositional \(\mu\)-calculus
cites work: An automata-theoretic approach to branching-time model checking
cites work: Module checking
cites work: A modal μ perspective on solving parity games in quasi-polynomial time
cites work: Infinite games played on finite graphs
cites work: On promptness in parity games
cites work: Q3940830
cites work: Solving Parity Games in Big Steps
cites work: Q4385530
cites work: Facets of Synthesis: Revisiting Church’s Problem
cites work: Attracting tangles to solve parity games
cites work: Q2754084
cites work: Alternating tree automata, parity games, and modal \(\mu\)-calculus
cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees
DOI: 10.1007/S10472-020-09721-3
description: scientific article; zbMATH DE number 7377237