Efficient Reachability Graph Representation of Petri Nets...

Electronic Notes in Theoretical Computer Science 2009 Vol. 239; Iss. none

Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters

Franck Pommereau, Raymond Devillers, Hanna Klaudel
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
239
Year:
2009
Language:
english
Pages:
11
DOI:
10.1016/j.entcs.2009.05.034
File:
PDF, 301 KB
english, 2009
Conversion to is in progress
Conversion to is failed