115 search results - page 3 / 23 » Synthesis of Asynchronous Hardware from Petri Nets |
ACSD
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we present two algorithms that effectively synthesize a finite place/transition Petri net (p/t-net) from a finite set of labeled partial orders (a finite partial lang...
ACSD
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
APN
2006
Springer
13 years 11 months ago
2006
Springer
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...
ACSD
2005
IEEE
14 years 1 months ago
2005
IEEE
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed processes in digital systems. In previous work, syst...
WSC
2007
13 years 9 months ago
2007
In this paper we present a survey on methods for the synthesis of Petri nets from behavioral descriptions given as languages. We consider place/transition Petri nets, elementary P...