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...

Full description

Bibliographic Details
Published in:Formal Aspects of Computing : Applicable Formal Methods, Vol. 13, No. 6 (2002), p. 447-470
Main Author: Badouel, Éric
Other Involved Persons: Caillaud, Benoît ; Darondeau, P.
Format: electronic Article
Language:English
ISSN:1433-299X
Item Description:Received November 2000 / Accepted in revised form August 2001
Physical Description:Online-Ressource
DOI:10.1007/s001650200022
Subjects:
QR Code: Show QR Code