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

Rom Langerak

doi:10.1016/S1571-0661(05)80293-2

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

Rom Langerak

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

1 Citation (Scopus)

60 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 language	English
Title of host publication	EXPRESS'99
Subtitle of host publication	6th International Workshop on Expressiveness in Concurrency
Editors	Ilaria Castellani, Björn Victor
Publisher	Elsevier
Pages	24-41
Number of pages	17
DOIs	https://doi.org/10.1016/S1571-0661(05)80293-2
Publication status	Published - 1999
Event	6th International Workshop on Expressiveness in Concurrency, EXPRESS 1999 - Eindhoven, Netherlands Duration: 23 Aug 1999 → 23 Aug 1999 Conference number: 6

Publication series

Name	Electronic Notes in Theoretical Computer Science
Publisher	Elsevier
Volume	27
ISSN (Print)	1571-0661

Workshop

Workshop	6th International Workshop on Expressiveness in Concurrency, EXPRESS 1999
Abbreviated title	EXPRESS
Country/Territory	Netherlands
City	Eindhoven
Period	23/08/99 → 23/08/99

Keywords

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

Access to Document

10.1016/S1571-0661(05)80293-2Licence: CC BY-NC-ND

Langerak1999derivingFinal published version, 848 KBLicence: CC BY-NC-ND

Cite this

@inproceedings{676b737a0e604573a4743829af865985,

title = "Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding",

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.",

keywords = "FMT-MC: MODEL CHECKING, FMT-PA: PROCESS ALGEBRAS",

author = "Rom Langerak",

year = "1999",

doi = "10.1016/S1571-0661(05)80293-2",

language = "English",

series = "Electronic Notes in Theoretical Computer Science",

publisher = "Elsevier",

pages = "24--41",

editor = "Ilaria Castellani and Bj{\"o}rn Victor",

booktitle = "EXPRESS'99",

address = "Netherlands",

note = "6th International Workshop on Expressiveness in Concurrency, EXPRESS 1999, EXPRESS ; Conference date: 23-08-1999 Through 23-08-1999",

}

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. Electronic Notes in Theoretical Computer Science, vol. 27, Elsevier, pp. 24-41, 6th International Workshop on Expressiveness in Concurrency, EXPRESS 1999, Eindhoven, Netherlands, 23/08/99. https://doi.org/10.1016/S1571-0661(05)80293-2

Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding. / Langerak, Rom.

EXPRESS'99: 6th International Workshop on Expressiveness in Concurrency. ed. / Ilaria Castellani; Björn Victor. Elsevier, 1999. p. 24-41 (Electronic Notes in Theoretical Computer Science; Vol. 27).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Langerak, Rom

N1 - Conference code: 6

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

KW - FMT-MC: MODEL CHECKING

KW - FMT-PA: PROCESS ALGEBRAS

U2 - 10.1016/S1571-0661(05)80293-2

DO - 10.1016/S1571-0661(05)80293-2

M3 - Conference contribution

T3 - Electronic Notes in Theoretical Computer Science

SP - 24

EP - 41

BT - EXPRESS'99

A2 - Castellani, Ilaria

A2 - Victor, Björn

PB - Elsevier

T2 - 6th International Workshop on Expressiveness in Concurrency, EXPRESS 1999

Y2 - 23 August 1999 through 23 August 1999

ER -

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

Abstract

Publication series

Workshop

Keywords

Access to Document

Fingerprint

Cite this