default search action
Transactions on Petri Nets and Other Models of Concurrency, Volume 17, 2023
- Maciej Koutny, Robin Bergenthum, Gianfranco Ciardo:
Transactions on Petri Nets and Other Models of Concurrency XVII. Lecture Notes in Computer Science 14150, Springer 2023, ISBN 978-3-662-68190-9 - Nicolas Amat, Pierre Bouvier, Hubert Garavel:
A Toolchain to Compute Concurrent Places of Petri Nets. 1-26 - Ruben Dobler Strand, Lars Michael Kristensen, Laure Petrucci:
Development and Verification of a Microservice Architecture for a Fire Risk Notification System. 27-53 - Federica Adobbati, Luca Bernardinello, Görkem Kilinç Soylu, Lucia Pomello:
Computing a Parametric Reveals Relation For Bounded Equal-Conflict Petri Nets. 54-83 - Michael Köhler-Bußmeier, Heiko Rölke:
Analysing Adaption Processes of Hornets. 84-107 - Bahareh Fatemi, Fazle Rabbi, Wendy MacCaull:
A Validated Learning Approach to Healthcare Process Analysis Through Contextual and Temporal Filtering. 108-137 - Philipp Bende, Olga Vovk, David Caraveo, Ludwig Pechmann, Martin Leucker:
A Case Study on Data Protection for a Cloud- and AI-Based Homecare Medical Device. 138-161 - Aishah Ahmed, Marta Pietkiewicz-Koutny:
Strategies for Minimising the Synthesised ENL-Systems. 162-188 - Federica Adobbati, Luca Bernardinello, Lucia Pomello, Riccardo Stramare:
Implementable Strategies for a Two-Player Asynchronous Game on Petri Nets. 189-211 - Anirban Bhattacharyya, Maciej Koutny:
Confusion-Tolerant Computation of Probability in Acyclic Nets. 212-245 - Johan Arcile, Raymond R. Devillers, Hanna Klaudel:
An Efficient State Space Construction for a Class of Timed Automata. 246-263 - Hanin Abdulrahman, Jason Steggles:
Compositional Techniques for Boolean Networks and Attractor Analysis. 264-294
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.