Trace nets and process automata
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 transitions. Trace...
|Published in:||Acta informatica, Vol. 32, No. 7 (1995), p. 647-679|
|Other Involved Persons:|
|Item Description:||This work was partly supported by the project MASK of the E.C. Program Science.|
|QR Code:||Show QR Code|