Satisfiability games for branching-time logics
type: Item
instance of: scholarly article
zbMATH Open document ID: 1312.03023
DOI: 10.2168/LMCS-9(4:5)2013
author: Oliver Friedmann
author: Martin Lange
author: Markus Latte
published in: Logical Methods in Computer Science
publication date: 2013-10-16T00:00:00Z
full work available at URL: https://arxiv.org/abs/1308.5165
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 6215586
zbMATH Keywords: temporal logic
zbMATH Keywords: automata
zbMATH Keywords: parity games
zbMATH Keywords: decidability
describes a project that uses: PGSolver
describes a project that uses: CTL-RP
MaRDI profile type: Publication
arXiv ID: 1308.5165
OpenAlex ID: W2028860036
title: Satisfiability games for branching-time logics
description: scientific article; zbMATH DE number 6215586