Searching for "A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Deciding a Class of Path Formuals for Conflict-Free Petri Nets
by Hsu-Chun Yen, Bow-Yaw Wang, Ming-Sheng Yang, E. Mayr, Siam J. Cornput — 1993
… of transitions for 1-bounded conflict-free Petri nets, Inform. Process. Left., 38 (1991), 71-76. [33] H. Yen, A…
Add To MetaCart

is decidable, Ttzeoret. Uomp. Sci. 98, 199-247.
by Valk And Vidal-Naquet, Ttzeoret Uomp Sci, Petri Nets, Regular Languages, J. Uomput, Slstem Sci — 38
… pairwise concurrency of transitions for 1-bounded conflict-free Petri nets, Inform. Process. Lett. 38, 71…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB