Search from the table of contents of 2.5 million books
Advanced Search (Beta)
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
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
Authors

ARI Id

1664695651321_2764074

Access

Not Available Free

Pages

51-62

DOI

10.1007/978-3-319-45994-3_4

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-319-45994-3_4

Loading...
Table of Contents of Book
Showing 1 to 15 of 15 entries
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...