Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
type: Item
instance of: scholarly article
title: Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
zbMATH Open document ID: 1195.68069
author: Paul Gastin
author: Dietrich Kuske
published in: Information and Computation
publication date: 2010-08-18T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5772401
zbMATH Keywords: complexity of MSO-definable local temporal logics over concurrent systems
MaRDI profile type: Publication
full work available at URL: j.ic.2009.12.003
OpenAlex ID: W2086380717
cites work: Q4737220
cites work: Local temporal logic is expressively complete for cograph dependence alphabets
cites work: LATIN 2004: Theoretical Informatics
cites work: Q3835817
cites work: Q3504344
cites work: Q4737221
cites work: CONCUR 2003 - Concurrency Theory
cites work: Mathematical Foundations of Computer Science 2003
cites work: CONCUR 2005 – Concurrency Theory
cites work: Shrinking games and local formulas
cites work: Weak alternating automata are not that weak
cites work: Q4951166
cites work: The monadic quantifier alternation hierarchy over grids and graphs
cites work: Alternating finite automata on \(\omega\)-words
cites work: Q4375802
cites work: Q3836531
cites work: Difficult configurations -- on the complexity of LTrL
DOI: 10.1016/J.IC.2009.12.003
description: scientific article; zbMATH DE number 5772401