Compositional Verification of Asynchonously Communicating Systems

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Abstract

    Within a network of asynchronously communicating systems, the complete network is often not known, or even available at run-time. Consequently, verifying whether the network of communicating systems behaves correctly, i.e., the network does not contain any deadlock or livelock, is impracticable. As such systems are highly concurrent by nature, Petri nets form a natural choice to model these systems and their communication.
    This paper presents a formal framework based on a generic communication condition to verify correctness of the system by pairwise checking whether these systems communicate correctly and fulfill some condition, then the whole network is guaranteed to behave correctly. As an example, this paper presents the elastic communication condition.
    Original languageEnglish
    Title of host publicationFormal Aspects of Component Software
    Subtitle of host publication11th International Symposium, FACS 2014, Bertinoro, Italy, September 10-12, 2014, Revised Selected Papers
    EditorsIvan Lanese, Eric Madelaine
    Place of PublicationCham
    PublisherSpringer
    Pages49-67
    Edition1
    ISBN (Electronic)978-3-319-15317-9
    ISBN (Print)978-3-319-15316-2
    DOIs
    Publication statusPublished - 18 Feb 2015

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer
    Volume8997
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Fingerprint

    Dive into the research topics of 'Compositional Verification of Asynchonously Communicating Systems'. Together they form a unique fingerprint.

    Cite this