Trace nets and process automata
Abstract Trace nets are a variant of one-safe Petri nets, where input and output places may be filled as well as emptied by transitions. Those extended nets are introduced for modelling concurrency in a simple format of structural operational specifications, based on permutation of proved transition...
|Published in:||Acta informatica, Vol. 32 (1995), p. 647-679|
|Other Involved Persons:||;|
|Item Description:||Copyright: Copyright 1995 Springer-Verlag|
|Other Editions:||Show all 2 Editions|
|QR Code:||Show QR Code|