Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding

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

    19 Downloads (Pure)

    Abstract

    The starting point of this paper is McMillan's complete finite prefix of an unfolding that has been obtained from a Petri net or a process algebra expression. The paper addresses the question of how to obtain the (possibly infinite) system behaviour from the complete finite prefix. An algorithm is presented to derive from the prefix a graph rewriting system that can be used to construct the unfolding. It is shown how to generate event sequences from the graph rewriting system which is important for constructing an interactive simulator. Finally it is indicated how the graph rewriting system yields a transition system that can be used for model checking and test derivation.
    Original languageEnglish
    Title of host publicationEXPRESS'99
    Subtitle of host publication6th International Workshop on Expressiveness in Concurrency
    EditorsIlaria Castellani, Björn Victor
    PublisherElsevier
    Pages24-41
    Number of pages17
    DOIs
    Publication statusPublished - 1999
    Event6th International Workshop on Expressiveness in Concurrency, EXPRESS 1999 - Eindhoven, Netherlands
    Duration: 23 Aug 199923 Aug 1999
    Conference number: 6

    Publication series

    NameElectronic Notes in Theoretical Computer Science
    PublisherElsevier
    Volume27
    ISSN (Print)1571-0661

    Workshop

    Workshop6th International Workshop on Expressiveness in Concurrency, EXPRESS 1999
    Abbreviated titleEXPRESS
    CountryNetherlands
    CityEindhoven
    Period23/08/9923/08/99

      Fingerprint

    Keywords

    • FMT-MC: MODEL CHECKING
    • FMT-PA: PROCESS ALGEBRAS

    Cite this

    Langerak, R. (1999). Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding. In I. Castellani, & B. Victor (Eds.), EXPRESS'99: 6th International Workshop on Expressiveness in Concurrency (pp. 24-41). (Electronic Notes in Theoretical Computer Science; Vol. 27). Elsevier. https://doi.org/10.1016/S1571-0661(05)80293-2