Alternation and bounded concurrency are reverse equivalent.
From MaRDI portal
Publication:1854297
DOI10.1006/inco.1999.2796zbMath1045.68565OpenAlexW2041393231MaRDI QIDQ1854297
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Statecharts: a visual formalism for complex systems
- A calculus of communicating systems
- Complexity results for two-way and multi-pebble automata and their logics
- Alternation
- Communicating sequential processes
- On the power of bounded concurrency I
- On the power of bounded concurrency II
- On the complexity of verifying concurrent transition systems
This page was built for publication: Alternation and bounded concurrency are reverse equivalent.
