长垣产业园区科技文献服务平台

会议文集


文集名Application and Theory of Petri Nets and Concurrency
会议名42nd International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2021)
中译名《第四十二届国际皮特里网与并发性的应用及理论会议》
机构University Sorbonne Paris Nord
会议日期June 23-25, 2021
会议地点Online
出版年2021
馆藏号339164


题名作者出版年
Topics in Region Theory and Synthesis ProblemsLuca Bernardinello2021
Flat Petri Nets (Invited Talk)Jerome Leroux2021
Cost and Quality in Crowdsourcing WorkflowsLoic Helouet; Zoltan Miklos; Rituraj Singh2021
Timed Petri Nets with Reset for Pipelined Synchronous Circuit DesignRemi Parrot; Mikael Briday; Olivier H. Roux2021
A Turn-Based Approach for Qualitative Time Concurrent GamesSerge Haddad; Didier Lime; Olivier H. Roux2021
Canonical Representations for Direct Generation of Strategies in High-Level Petri GamesManuel Gieseking; Nick Wurdemann2021
Automatic Synthesis of Transiently Correct Network Updates via Petri GamesMartin Didriksen; Peter G. Jensen; Jonathan F. Jonler; Andrei-Ioan Katona; Sangey D. L. Lama; Frederik B. Lottrup; Shahab Shajarat; Jiri Srba2021
Computing Parameterized Invariants of Parameterized Petri NetsJavier Esparza; Mikhail Raskin; Christoph Welzel2021
On the Combination of Polyhedral Abstraction and SMT-Based Model Checking for Petri NetsNicolas Amat; Bernard Berthomieu; Silvano Dal Zilio2021
Skeleton Abstraction for Universal Temporal PropertiesSophie Wallner; Karsten Wolf2021
Reduction Using Induced Subnets to Systematically Prove Properties for Free-Choice NetsWil M. P. van der Aalst2021
Model Checking of Synchronized Domain-Specific Multi-formalism Models Using High-Level Petri NetsMichael Haustermann; David Mosteller; Daniel Moldt2021
Edge, Event and State Removal: The Complexity of Some Basic Techniques that Make Transition Systems Petri Net ImplementableRonny Tredup2021
Synthesis of (Choice-Free) Reset NetsRaymond Devillers2021
Synthesis of Petri Nets with Restricted Place-Environments: Classical and ParameterizedRonny Tredup2021
Discovering Stochastic Process Models by Reduction and AbstractionAdam Burke; Sander J. J. Leemans; Moe Thandar Wynn2021
Efficient Algorithms for Three Reachability Problems in Safe Petri NetsPierre Bouvier; Hubert Garavel2021
A Lazy Query Scheme for Reachability Analysis in Petri NetsLoig Jezequel; Didier Lime; Bastien Seree2021
Abstraction-Based Incremental Inductive Coverability for Petri NetsJiawen Kang; Yunjun Bai; Li Jiao2021
Firing Partial Orders in a Petri NetRobin Bergenthum2021
12