A valuation-based analysis of conflict-free Petri nets
Resource
Systems & Control Letters 45 (5): 387-395
Journal
Systems & Control Letters
Journal Volume
45
Journal Issue
5
Pages
387-395
Date Issued
2002
Date
2002
Author(s)
Abstract
We propose a novel valuation-based approach for analyzing conflict-free Petri nets. The basic idea is to associate a natural number, called the valuation, to each marking in the Petri net. If the set of markings of zero valuation is forward closed, then the valuation along any Petri net computation is nonincreasing, and in many cases, has the tendency to move towards zero valuation. Using the valuation-based method, we demonstrate a number of problems for conflict-free Petri nets to be decidable. © 2001 Elsevier Science B.V. All rights reserved.
Subjects
Controllability; Decidability; Fairness; Petri net; Reachability analysis
Other Subjects
Computability and decidability; Controllability; Problem solving; Reachability analysis; Petri nets
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
14.pdf
Size
176.89 KB
Format
Adobe PDF
Checksum
(MD5):9e528bc128b27bc3a1b187fc6f50e7ac