Alternation and bounded concurrency are reverse equivalent.

DOI10.1006/INCO.1999.2796MaRDI QIDQ1854297zbMATH OpenOpenAlexFDO

Authors Tirza Hirst, Moshe Lewenstein

Publication date 14 January 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/9e048eb49b9babd9ca7efe88f74262e2bfed1deb

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Concurrency and reversibility
• scientific article; zbMATH DE number 4092736
• From bounded to unbounded concurrency objects and back
• Reversibility and models for concurrency
• Bounded concurrency
• Concurrencies in reversible concurrent calculi
• scientific article; zbMATH DE number 4035117
• Constraint-based concurrency and beyond
• Reverse exchange for concurrency and local reasoning
• Bounded context-switching and reentrant locking

Cites work

• A calculus of communicating systems
• Alternation
• Communicating sequential processes
• Complexity results for two-way and multi-pebble automata and their logics
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• On the complexity of verifying concurrent transition systems
• On the power of bounded concurrency I
• On the power of bounded concurrency II
• Statecharts: a visual formalism for complex systems

Cited in

(5)

• A Rice-style theorem for parallel automata
• scientific article; zbMATH DE number 17792 (Why is no real title available?)
• On the power of bounded concurrency I
• On the power of bounded concurrency II
• Bounded concurrency

This page was built for publication: Alternation and bounded concurrency are reverse equivalent.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854297)