arXiv (All)
open access
Adding Reconfiguration to Zielonka's Asynchronous Automata
We study an extension of Zielonka's (fixed) asynchronous automata called reconfigurable asynchronous automata where processes can dynamically change who they communicate with. We show that reconfigurable asynchronous automata are not more expressive than fixed asynchronous automata by giving transla
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Call Processing Language Framework and Requirements#139502
- An Automata-Based Approach for Synchronizable Mailbox Communication#635169
- Verifying robustness of event-driven asynchronous programs against concurrency#955191
- On the Design of Application Protocols#141868
- Introduction to Complex Automata using Cook Algebra#110998
Record · ID 1035251
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive