Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding
β Scribed by Rom Langerak
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 989 KB
- Volume
- 27
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
β¦ Synopsis
The starting point of this paper is McMillan's complete nite pre x 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 in nite) system behaviour from the complete nite pre x. An algorithm is presented to derive from the pre x 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 i s i m p o r t a n t 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.
π SIMILAR VOLUMES
## Abstract ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 200 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a βFull Textβ option. The original article is trackable v