| dc.contributor.author | Philippou, Anna | en |
| dc.contributor.author | Michael, G. | en |
| dc.creator | Philippou, Anna | en |
| dc.creator | Michael, G. | en |
| dc.date.accessioned | 2019-11-13T10:42:00Z | |
| dc.date.available | 2019-11-13T10:42:00Z | |
| dc.date.issued | 2006 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/54842 | |
| dc.description.abstract | A value-passing, asynchronous process calculus and its associated theory of confluence are considered as a basis for establishing the correctness of distributed algorithms. In particular, we present an asynchronous version of value-passing CCS and we develop its theory of confluence. We show techniques for demonstrating confluence of complex processes in a compositional manner and we study properties of confluent systems that can prove useful for their verification. These results give rise to a methodology for system verification which we illustrate by proving the correctness of two distributed leader-election algorithms. © Springer-Verlag Berlin Heidelberg 2006. | en |
| dc.source | 10th International Conference on Principles of Distributed Systems, OPODIS 2006 | en |
| dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-51749124902&doi=10.1007%2f11945529-13&partnerID=40&md5=d8cf162f0fe0e2dede0303fc2a6501df | |
| dc.subject | Algorithms | en |
| dc.subject | Artificial intelligence | en |
| dc.subject | Computer science | en |
| dc.subject | Complex Processes | en |
| dc.subject | Process calculi | en |
| dc.subject | Asynchronous version | en |
| dc.subject | System verifications | en |
| dc.subject | Verification techniques | en |
| dc.title | Verification techniques for distributed algorithms | en |
| dc.type | info:eu-repo/semantics/article | |
| dc.identifier.doi | 10.1007/11945529-13 | |
| dc.description.volume | 4305 LNCS | en |
| dc.description.startingpage | 172 | |
| dc.description.endingpage | 186 | |
| dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
| dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
| dc.type.uhtype | Article | en |
| dc.description.notes | Conference code: 100109 | en |
| dc.description.notes | Cited By :2</p> | en |
| dc.description.notes | <p>Sponsors: Agence Universitaire de la Francophonie (AUF) | fr |
| dc.description.notes | L'Ecole Pratique des Hautes Etudes (EPHE) | fr |
| dc.description.notes | Laboratoire d'Informatique et des Systemes Complexes (LAISC) | fr |
| dc.description.notes | Universite Paris 8, Laboratoire Cognition et Usage | fr |
| dc.source.abbreviation | Lect. Notes Comput. Sci. | en |
