« Back to Record
Citation APA

Reynier, P.-A., & Servais, F. (2011). Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning. Lecture notes in computer science, 6709 LNCS, 69-88. doi:10.1007/978-3-642-21834-7_5


Permalink

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

Reynier, P.-A., & Servais, F. (2011). Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning. Lecture notes in computer science, 6709 LNCS, 69-88. doi:10.1007/978-3-642-21834-7_5