Generalisation of the Well-Specified Check

Holger Hermanns, Daulet Turetayev

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

    10 Downloads (Pure)

    Abstract

    This extended abstract sketches a generalisation of the well-specified algorithm which is used to check whether a stochastic process associated with instances of popular specification formalisms is unique. The generalised algorithm is computationally more expensive, since it explores the specified behaviour in multiple levels up to a user-specified depth. For depth 1, the essence of the original algorithm is obtained, while the exploration of more than 1 level allows one to accept specifications that are rejected by the original algorithm.
    Original languageEnglish
    Title of host publicationPMCCS-6
    Subtitle of host publicationThe Sixth International Workshop on Performability Modeling of Computer and Communication Systems
    EditorsAndrea Bobbio, Daniel Deavours, Yue Ma
    Place of PublicationUrbana-Champaign
    PublisherUniversity of Illinois at Urbana-Champaign
    Pages19-22
    Publication statusPublished - 6 Sep 2003
    Event6th International Workshop on Performability Modeling of Computer and Communication Systems, PMCCS 2003 - Monticello, United States
    Duration: 6 Sep 20037 Sep 2003
    Conference number: 6

    Conference

    Conference6th International Workshop on Performability Modeling of Computer and Communication Systems, PMCCS 2003
    Abbreviated titlePMCCS
    CountryUnited States
    CityMonticello
    Period6/09/037/09/03

    Fingerprint

    Dive into the research topics of 'Generalisation of the Well-Specified Check'. Together they form a unique fingerprint.

    Cite this