scientific article; zbMATH DE number 7559466

DOI10.4230/LIPICS.CONCUR.2020.10MaRDI QIDQ5089274zbMATH OpenFDO

Authors Javier Esparza, Fabian Reiter

Publication date 18 July 2022

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

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

• scientific article; zbMATH DE number 3735115 (Why is no real title available?)
• Asynchronous distributed automata: a characterization of the modal \(\mu\)-fragment
• Complexity of network synchronization
• Computation in networks of passively mobile finite-state sensors
• Computation in networks of passively mobile finite-state sensors
• Computation with finite stochastic chemical reaction networks
• Deploying wireless networks with beeps
• Stone age distributed computing
• Synchronous to asynchronous transformation of polyautomata
• Weak models of distributed computing, with connections to modal logic

Cited in

(3)

• Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
• Weak models of distributed computing, with connections to modal logic
• A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation

This page was built for publication:

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