scientific article; zbMATH DE number 7559466

DOI10.4230/LIPIcs.CONCUR.2020.10MaRDI QIDQ5089274

Javier Esparza, Fabian Reiter

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2007.03291

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

asynchronyconcurrency theoryweak models of distributed computing

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Computation with finite stochastic chemical reaction networks
• Synchronous to asynchronous transformation of polyautomata
• Computation in networks of passively mobile finite-state sensors
• Deploying Wireless Networks with Beeps
• Complexity of network synchronization
• Stone age distributed computing
• Computation in networks of passively mobile finite-state sensors
• Weak models of distributed computing, with connections to modal logic

This page was built for publication: