129 search results - page 1 / 26 » Completeness Results for Linear Logic on Petri Nets |
MFCS
1993
Springer
13 years 9 months ago
1993
Springer
COCOON
2003
Springer
13 years 10 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
ICCAD
2003
IEEE
14 years 2 months ago
2003
IEEE
A new technique for the logic synthesis of asynchronous circuits is presented. It is based on the structural theory of Petri nets and integer linear programming. The technique is ...
APN
2001
Springer
13 years 9 months ago
2001
Springer
We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by in...
FSKD
2011
Springer
12 years 4 months ago
2011
Springer
—With the wide utilization of Petri nets, many researchers suggest that Petri nets should be reused and shared. Emerging the Semantic Web technologies, such as ontologies, can pl...