On Convergence of Concurrent Systems under Regular Interactions
From MaRDI portal
Publication:3184697
DOI10.1007/978-3-642-04081-8_35zbMath1254.68178OpenAlexW1598703967MaRDI QIDQ3184697
Pavithra Prabhakar, Sayan Mitra, Mahesh Viswanathan
Publication date: 22 October 2009
Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_35
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Convergence Verification: From Shared Memory to Partially Synchronous Systems
- A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
- On the stability of asynchronous iterative processes
- Asymptotic agreement in distributed estimation
- Consensus and Cooperation in Networked Multi-Agent Systems
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
This page was built for publication: On Convergence of Concurrent Systems under Regular Interactions
