Old and New Algorithms for Minimal Coverability Sets

Antti Valmari; Henri Hansen

doi:10.1007/978-3-642-31131-4_12

Old and New Algorithms for Minimal Coverability Sets

Antti Valmari
, Henri Hansen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

12 Citations (Scopus)

Translated title of the contribution	Old and New Algorithms for Minimal Coverability Sets
Original language	English
Title of host publication	Application and Theory of Petri Nets. 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012. Proceedings. Lecture Notes in Computer Science
Place of Publication	Berlin
Publisher	Springer
Pages	208-227
ISBN (Electronic)	978-3-642-31131-4
ISBN (Print)	978-3-642-31130-7
DOIs	https://doi.org/10.1007/978-3-642-31131-4_12
Publication status	Published - 2012
Publication type	A4 Article in conference proceedings

Publication series

Name	International Conference on Application and Theory of Petri Nets and Concurrency
Volume	7347
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Publication forum classification

Publication forum level 1

Access to Document

10.1007/978-3-642-31131-4_12

Cite this

Valmari, A., & Hansen, H. (2012). Old and New Algorithms for Minimal Coverability Sets. In Application and Theory of Petri Nets. 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012. Proceedings. Lecture Notes in Computer Science (pp. 208-227). (International Conference on Application and Theory of Petri Nets and Concurrency; Vol. 7347). Springer. https://doi.org/10.1007/978-3-642-31131-4_12

Valmari, Antti ; Hansen, Henri. / Old and New Algorithms for Minimal Coverability Sets. Application and Theory of Petri Nets. 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012. Proceedings. Lecture Notes in Computer Science. Berlin : Springer, 2012. pp. 208-227 (International Conference on Application and Theory of Petri Nets and Concurrency).

@inproceedings{31fe62f7448a49469db9c3f28fed3e9d,

title = "Old and New Algorithms for Minimal Coverability Sets",

author = "Antti Valmari and Henri Hansen",

note = "ei ut-numeroa 21.9.2013<br/>Contribution: organisation=ohj,FACT1=1<br/>Publisher name: Springer",

year = "2012",

doi = "10.1007/978-3-642-31131-4\_12",

language = "English",

isbn = "978-3-642-31130-7",

series = "International Conference on Application and Theory of Petri Nets and Concurrency",

publisher = "Springer",

pages = "208--227",

booktitle = "Application and Theory of Petri Nets. 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012. Proceedings. Lecture Notes in Computer Science",

}

Valmari, A & Hansen, H 2012, Old and New Algorithms for Minimal Coverability Sets. in Application and Theory of Petri Nets. 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012. Proceedings. Lecture Notes in Computer Science. International Conference on Application and Theory of Petri Nets and Concurrency, vol. 7347, Springer, Berlin, pp. 208-227. https://doi.org/10.1007/978-3-642-31131-4_12

Old and New Algorithms for Minimal Coverability Sets. / Valmari, Antti; Hansen, Henri.
Application and Theory of Petri Nets. 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012. Proceedings. Lecture Notes in Computer Science. Berlin: Springer, 2012. p. 208-227 (International Conference on Application and Theory of Petri Nets and Concurrency; Vol. 7347).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

TY - GEN

T1 - Old and New Algorithms for Minimal Coverability Sets

AU - Valmari, Antti

AU - Hansen, Henri

N1 - ei ut-numeroa 21.9.2013<br/>Contribution: organisation=ohj,FACT1=1<br/>Publisher name: Springer

PY - 2012

Y1 - 2012

U2 - 10.1007/978-3-642-31131-4_12

DO - 10.1007/978-3-642-31131-4_12

M3 - Conference contribution

SN - 978-3-642-31130-7

T3 - International Conference on Application and Theory of Petri Nets and Concurrency

SP - 208

EP - 227

BT - Application and Theory of Petri Nets. 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012. Proceedings. Lecture Notes in Computer Science

PB - Springer

CY - Berlin

ER -

Valmari A, Hansen H. Old and New Algorithms for Minimal Coverability Sets. In Application and Theory of Petri Nets. 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012. Proceedings. Lecture Notes in Computer Science. Berlin: Springer. 2012. p. 208-227. (International Conference on Application and Theory of Petri Nets and Concurrency). doi: 10.1007/978-3-642-31131-4_12