scholarly journals On Functions Weakly Computable by Petri Nets and Vector Addition Systems

Author(s):  
J. Leroux ◽  
Ph. Schnoebelen
Keyword(s):  
1994 ◽  
Vol 05 (03n04) ◽  
pp. 281-292
Author(s):  
HSU-CHUN YEN ◽  
BOW-YAW WANG ◽  
MING-SHANG YANG

We define a subclass of Petri nets called m–state n–cycle Petri nets, each of which can be thought of as a ring of n bounded (by m states) Petri nets using n potentially unbounded places as joins. Let Ring(n, l, m) be the class of m–state n–cycle Petri nets in which the largest integer mentioned can be represented in l bits (when the standard binary encoding scheme is used). As it turns out, both the reachability problem and the boundedness problem can be decided in O(n(l+log m)) nondeterministic space. Our results provide a slight improvement over previous results for the so-called cyclic communicating finite state machines. We also compare and contrast our results with that of VASS(n, l, s), which represents the class of n-dimensional s-state vector addition systems with states where the largest integer mentioned can be described in l bits.


Author(s):  
Rosemarie Yagoda ◽  
Michael D. Coovert

1988 ◽  
Vol 135 (4) ◽  
pp. 239 ◽  
Author(s):  
J. Duggan ◽  
J. Browne
Keyword(s):  

1995 ◽  
Vol 115 (7) ◽  
pp. 914-919
Author(s):  
Kazuyuki Mori ◽  
Makoto Tsukiyama ◽  
Toyoo Fukuda

2009 ◽  
Vol 129 (5) ◽  
pp. 455-461 ◽  
Author(s):  
Xinhong Hei ◽  
Sei Takahashi ◽  
Hideo Nakamura
Keyword(s):  

Author(s):  
Д.Э.Я. Окаи ◽  
D.E.Ya. Okai ◽  
А.Ю. Клюшин ◽  
A.Yu. Klyushin ◽  
В.Н. Богатиков ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document