64 search results - page 4 / 13 » A Symbolic Algorithm for the Synthesis of Bounded Petri Nets |
AWPN
2008
13 years 7 months ago
2008
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
APN
2004
Springer
13 years 11 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
ACSD
2007
IEEE
13 years 9 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 7 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...
ACSD
2008
IEEE
14 years 8 days ago
2008
IEEE
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, two automati...