### Abstract

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

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 | Netherlands |

City | Eindhoven |

Period | 23/08/99 → 23/08/99 |

### Fingerprint

### Keywords

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

### Cite this

*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

}

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

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

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

ER -