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

Autor:	Langerak, Rom, Castellani, Ilaria, Victor, Björn
Rok vydání:	1999
Předmět:	Discrete mathematics Graph rewriting General Computer Science Voltage graph Prefix grammar Graph algebra FMT-PA: PROCESS ALGEBRAS FMT-MC: MODEL CHECKING Theoretical Computer Science Prefix Confluence Transition system Null graph Mathematics Computer Science(all)
Zdroj:	EXPRESS EXPRESS'99: 6th International Workshop on Expressiveness in Concurrency, 24-41 STARTPAGE=24;ENDPAGE=41;TITLE=EXPRESS'99
ISSN:	1571-0661
DOI:	10.1016/s1571-0661(05)80293-2
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22472d8eef4e8f69521dd8d1ef1c1345 Zobrazit plný text záznamu Full Text from ScienceDirect