« Back to Record
Citation APA

Pommereau, F., Devillers, R., & Klaudel, H. (2009). Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters. Electronic Notes in Theoretical Computer Science, 239(C), 119-129. doi:10.1016/j.entcs.2009.05.034


Permalink

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/171022

Pommereau, F., Devillers, R., & Klaudel, H. (2009). Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters. Electronic Notes in Theoretical Computer Science, 239(C), 119-129. doi:10.1016/j.entcs.2009.05.034