Home > Reachability Problems: 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings > Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs
Reachability Problems: 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings |
Springer International Publishing
Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs
Chapter Info
Authors
ARI Id
1664695651321_2764074
Access
Not Available Free
Pages
51-62
DOI
Chapter URL
Table of Contents of Book
Showing 1 to 15 of 15 entries
Chapters/Headings | Author(s) | Pages | Info |
I-XIV | |||
1-22 | |||
23-35 | |||
36-50 | |||
51-62 | |||
63-76 | |||
77-89 | |||
90-103 | |||
104-118 | |||
119-133 | |||
134-147 | |||
148-162 | |||
163-176 | |||
177-191 | |||
193-193 | |||
Chapters/Headings | Author(s) | Pages | Info |
Showing 1 to 15 of 15 entries
Similar Books
Loading...
Similar Chapters
Loading...
Similar Thesis
Loading...
Similar News
Loading...
Similar Articles
Loading...
Similar Article Headings
Loading...