Distributing Finite Automata Through Petri Net Synthesis

Abstract

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 that events at different locations have no common input place… (More)
DOI: 10.1007/s001650200022

14 Figures and Tables

Topics

Statistics

0510'05'07'09'11'13'15'17
Citations per Year

52 Citations

Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics