On the power of bounded concurrency II

DOI10.1145/176584.176588zbMath0822.68067OpenAlexW2092111053MaRDI QIDQ4305672

David Harel, Tirza Hirst

Publication date: 13 October 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/176584.176588

zbMATH Keywords

models of computationbounded cooperative concurrency

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (6)

On the sizes of DPDAs, PDAs, LBAs ⋮ On the complexity of verifying concurrent transition systems ⋮ A Rice-style theorem for parallel automata ⋮ Teams of pushdown automata ⋮ Alternation and bounded concurrency are reverse equivalent. ⋮ On the complexity of verifying concurrent transition systems

This page was built for publication: On the power of bounded concurrency II