%0 Conference Paper %1 conf/apn/EsparzaRW19 %A Esparza, Javier %A Raskin, Mikhail %A Weil-Kennedy, Chana %B Petri Nets %D 2019 %E Donatelli, Susanna %E Haar, Stefan %I Springer %K immediateobservation populationprotocols %P 365-385 %T Parameterized Analysis of Immediate Observation Petri Nets. %U http://arxiv.org/abs/1902.03025 %V 11522 %X We introduce immediate observation Petri nets, a class of interest in the study of population protocols (a model of distributed computation), and enzymatic chemical networks. In these areas, relevant analysis questions translate into parameterized Petri net problems: whether an infinite set of Petri nets with the same underlying net, but different initial markings, satisfy a given property. We study the parameterized reachability, coverability, and liveness problems for immediate observation Petri nets. We show that all three problems are in PSPACE for infinite sets of initial markings defined by counting constraints, a class sufficiently rich for the intended application. This is remarkable, since the problems are already PSPACE-hard when the set of markings is a singleton, i.e., in the non-parameterized case. We use these results to prove that the correctness problem for immediate observation population protocols is PSPACE-complete, answering a question left open in a previous paper. %@ 978-3-030-21571-2

@inproceedings{conf/apn/EsparzaRW19, abstract = {We introduce immediate observation Petri nets, a class of interest in the study of population protocols (a model of distributed computation), and enzymatic chemical networks. In these areas, relevant analysis questions translate into parameterized Petri net problems: whether an infinite set of Petri nets with the same underlying net, but different initial markings, satisfy a given property. We study the parameterized reachability, coverability, and liveness problems for immediate observation Petri nets. We show that all three problems are in PSPACE for infinite sets of initial markings defined by counting constraints, a class sufficiently rich for the intended application. This is remarkable, since the problems are already PSPACE-hard when the set of markings is a singleton, i.e., in the non-parameterized case. We use these results to prove that the correctness problem for immediate observation population protocols is PSPACE-complete, answering a question left open in a previous paper.}, added-at = {2020-01-16T17:47:40.000+0100}, author = {Esparza, Javier and Raskin, Mikhail and Weil-Kennedy, Chana}, biburl = {https://www.bibsonomy.org/bibtex/207d662f374759b7bb14822de3a79d55a/paves_intern}, booktitle = {Petri Nets}, crossref = {conf/apn/2019}, description = {Parameterized Analysis of Immediate Observation Petri Nets}, editor = {Donatelli, Susanna and Haar, Stefan}, ee = {https://doi.org/10.1007/978-3-030-21571-2_20}, interhash = {dfacff90d4712d4f899fe8afb8bccaa7}, intrahash = {07d662f374759b7bb14822de3a79d55a}, isbn = {978-3-030-21571-2}, keywords = {immediateobservation populationprotocols}, note = {cite arxiv:1902.03025}, pages = {365-385}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2020-01-16T17:47:40.000+0100}, title = {Parameterized Analysis of Immediate Observation Petri Nets.}, url = {http://arxiv.org/abs/1902.03025}, volume = 11522, year = 2019 }