@会议记录{raskin_et_al:LIPIcs.CONCUR.2020.45,author={Raskin、Mikhail和Weil-Kennedy、Chana和Esparza、Javier},title={{即时观测Petri网的平坦性和复杂性}},booktitle={第31届并行理论国际会议(CONCUR 2020)},页数={45:1--45:19},series={Leibniz国际信息学论文集(LIPIcs)},国际标准图书编号={978-3-95977-160-3},ISSN={1868-8969},年份={2020年},体积={171},editor={Konnov、Igor和Kov{a} cs公司,劳拉},publisher={Schloss Dagstuhl--Leibniz Zentrum f{\“u}r Informatik},地址={Dagstuhl,德国},网址={https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.45},URN={URN:nbn:de:0030-drops-128574},doi={10.4230/LIPIcs.CONCUR.2020.45},annote={关键词:Petri网,可达性分析,参数化验证,平坦性}}