LTL is expressively complete for Mazurkiewicz traces
type: Item
instance of: scholarly article
title: LTL is expressively complete for Mazurkiewicz traces
zbMATH Open document ID: 1013.68130
author: Volker Diekert
author: Paul Gastin
published in: Journal of Computer and System Sciences
publication date: 2002-08-04T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 1775702
zbMATH Keywords: concurrency
zbMATH Keywords: linear temporal logic
MaRDI profile type: Publication
full work available at URL: jcss.2001.1817
OpenAlex ID: W1992383908
cites work: Q4945225
cites work: Q2754145
cites work: Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets
cites work: Q4738286
cites work: Logical definability on infinite traces
cites work: Q3835817
cites work: Q4218111
cites work: Q4381400
cites work: Q4375802
cites work: A ν-calculus with local views for systems of sequential agents
cites work: TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION
cites work: An expressively complete linear time temporal logic for Mazurkiewicz traces
cites work: Q4219025
cites work: Q4251040
DOI: 10.1006/JCSS.2001.1817
description: scientific article; zbMATH DE number 1775702