Distributing Finite Automata Through Petri Net Synthesis
The synthesis problem for Petri nets consists in deciding constructively the existence of a Petri net with sequential state graph isomorphic to a given graph. If events are attached to locations, one may set as an additional requirement that the synthesised net should be distributable; i.e. such tha...
|Published in:||Formal Aspects of Computing : Applicable Formal Methods, Vol. 13, No. 6 (2002), p. 447-470|
|Other Involved Persons:||;|
|Item Description:||Received November 2000 / Accepted in revised form August 2001|
|QR Code:||Show QR Code|