On Convergence of Concurrent Systems under Regular Interactions
DOI10.1007/978-3-642-04081-8_35zbMATH Open1254.68178OpenAlexW1598703967MaRDI QIDQ3184697FDOQ3184697
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
Recommendations
- Infinite concurrent systems. I: The relationship between metric and order convergence
- scientific article; zbMATH DE number 4062568
- scientific article; zbMATH DE number 3870604
- scientific article
- Tight bound for deciding convergence of consensus systems
- Concurrency and interaction in complex systems
- A spectral property for concurrent systems and some probabilistic applications
- Convergence Verification: From Shared Memory to Partially Synchronous Systems
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
- 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
- Asymptotic agreement in distributed estimation
- A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
- On the stability of asynchronous iterative processes
- Convergence Verification: From Shared Memory to Partially Synchronous Systems
Cited In (4)
This page was built for publication: On Convergence of Concurrent Systems under Regular Interactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184697)
