The complexity of PDL with interleaving
type: Item
instance of: scholarly article
title: The complexity of PDL with interleaving
zbMATH Open document ID: 0872.03016
DOI: 10.1016/0304-3975(95)00095-X
author: Alain J. Mayer
author: Larry J. Stockmeyer
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B45
zbMATH DE Number: 984570
MaRDI profile type: Publication
cites work: Alternation
cites work: Complexity measures for regular expressions
cites work: Propositional dynamic logic of regular programs
cites work: Q3888558
cites work: Propositional dynamic logic of flowcharts
cites work: Q5592246
cites work: Deciding true concurrency equivalences on safe, finite nets
cites work: Q4385540
cites work: Concurrent dynamic logic
cites work: A near-optimal method for reasoning about action
cites work: Q3953158
cites work: Checking equivalences between concurrent systems of finite agents (Extended abstract)
cites work: Q3888985
cites work: Q4131648
cites work: Q3707407
cites work: On the complexity of iterated shuffle
full work available at URL: 0304-3975(95)00095-x
OpenAlex ID: W2000261666
description: scientific article; zbMATH DE number 984570