Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID42nd Petri Nets 2021: Virtual Event
- Didier Buchs, Josep Carmona
:
Application and Theory of Petri Nets and Concurrency - 42nd International Conference, PETRI NETS 2021, Virtual Event, June 23-25, 2021, Proceedings. Lecture Notes in Computer Science 12734, Springer 2021, ISBN 978-3-030-76982-6
Keynotes
- Luca Bernardinello:
Topics in Region Theory and Synthesis Problems. 3-16 - Jérôme Leroux:
Flat Petri Nets (Invited Talk). 17-30
Application of Concurrency to System Design
- Loïc Hélouët, Zoltán Miklós, Rituraj Singh:
Cost and Quality in Crowdsourcing Workflows. 33-54 - Rémi Parrot, Mikaël Briday, Olivier H. Roux:
Timed Petri Nets with Reset for Pipelined Synchronous Circuit Design. 55-75 - Serge Haddad, Didier Lime, Olivier H. Roux:
A Turn-Based Approach for Qualitative Time Concurrent Games. 76-92
Games
- Manuel Gieseking, Nick Würdemann:
Canonical Representations for Direct Generation of Strategies in High-Level Petri Games. 95-117 - Martin Didriksen, Peter Gjøl Jensen, Jonathan F. Jønler, Andrei-Ioan Katona, Sangey D. L. Lama, Frederik B. Lottrup, Shahab Shajarat, Jirí Srba:
Automatic Synthesis of Transiently Correct Network Updates via Petri Games. 118-137
Verification
- Javier Esparza, Mikhail A. Raskin, Christoph Welzel:
Computing Parameterized Invariants of Parameterized Petri Nets. 141-163 - Nicolas Amat, Bernard Berthomieu, Silvano Dal-Zilio:
On the Combination of Polyhedral Abstraction and SMT-Based Model Checking for Petri Nets. 164-185 - Sophie Wallner, Karsten Wolf:
Skeleton Abstraction for Universal Temporal Properties. 186-207 - Wil M. P. van der Aalst:
Reduction Using Induced Subnets to Systematically Prove Properties for Free-Choice Nets. 208-229 - Michael Haustermann, David Mosteller, Daniel Moldt:
Model Checking of Synchronized Domain-Specific Multi-formalism Models Using High-Level Petri Nets. 230-249
Synthesis and Mining
- Ronny Tredup:
Edge, Event and State Removal: The Complexity of Some Basic Techniques that Make Transition Systems Petri Net Implementable. 253-273 - Raymond R. Devillers:
Synthesis of (Choice-Free) Reset Nets. 274-291 - Ronny Tredup:
Synthesis of Petri Nets with Restricted Place-Environments: Classical and Parameterized. 292-311 - Adam Burke, Sander J. J. Leemans, Moe Thandar Wynn:
Discovering Stochastic Process Models by Reduction and Abstraction. 312-336
Reachability and Partial Order
- Pierre Bouvier, Hubert Garavel:
Efficient Algorithms for Three Reachability Problems in Safe Petri Nets. 339-359 - Loïg Jezequel, Didier Lime, Bastien Sérée:
A Lazy Query Scheme for Reachability Analysis in Petri Nets. 360-378 - Jiawen Kang, Yunjun Bai, Li Jiao:
Abstraction-Based Incremental Inductive Coverability for Petri Nets. 379-398 - Robin Bergenthum:
Firing Partial Orders in a Petri Net. 399-419
Semantics
- Samy Abbes:
Deterministic Concurrent Systems. 423-442 - Rüdiger Valk:
Deciphering the Co-Car Anomaly of Circular Traffic Queues Using Petri Nets. 443-462
Tools
- Daniel Schuster, Sebastiaan J. van Zelst, Wil M. P. van der Aalst:
Cortado - An Interactive Tool for Data-Driven Process Discovery and Modeling. 465-475 - Marco Pegoraro, Merih Seran Uysal, Wil M. P. van der Aalst:
PROVED: A Tool for Graph Representation and Analysis of Uncertain Event Data. 476-486
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-10 21:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
