default search action
Transactions on Petri Nets and Other Models of Concurrency, Volume 13, 2018
- Maciej Koutny, Lars Michael Kristensen, Wojciech Penczek:
Transactions on Petri Nets and Other Models of Concurrency XIII. Lecture Notes in Computer Science 11090, Springer 2018, ISBN 978-3-662-58380-7 - Sebastiaan J. van Zelst, Alfredo Bolt, Boudewijn F. van Dongen:
Computing Alignments of Event Data and Process Models. 1-26 - Benjamin Dalmas, Niek Tax, Sylvie Norre:
Heuristic Mining Approaches for High-Utility Local Process Models. 27-51 - Luca Bernardinello, Carlo Ferigato, Lucia Pomello, Adrián Puerto Aubel:
On Stability of Regional Orthomodular Posets. 52-72 - Elvio Gilberto Amparore, Susanna Donatelli, Marco Beccuti, Giulio Garbi, Andrew S. Miner:
Decision Diagrams for Petri Nets: A Comparison of Variable Ordering Algorithms. 73-92 - Pascale Möller, Michael Haustermann, David Mosteller, Dennis Schmitz:
Model Synchronization and Concurrent Simulation of Multiple Formalisms Based on Reference Nets. 93-115 - Karima Ennaoui, Lhouari Nourine, Farouk Toumani:
Complexity Aspects of Web Services Composition. 116-135 - Anna Gogolinska, Lukasz Mikulski, Marcin Piatkowski:
GPU Computations and Memory Access Model Based on Petri Nets. 136-157 - Rui Wang, Lars Michael Kristensen, Hein Meling, Volker Stolz:
Model-Based Testing of the Gorums Framework for Fault-Tolerant Distributed Systems. 158-180 - Fabrice Kordon, Hubert Garavel, Lom-Messan Hillah, Emmanuel Paviot-Adet, Loïg Jezequel, Francis Hulin-Hubard, Elvio Gilberto Amparore, Marco Beccuti, Bernard Berthomieu, Hugues Evrard, Peter Gjøl Jensen, Didier Le Botlan, Torsten Liebke, Jeroen Meijer, Jirí Srba, Yann Thierry-Mieg, Jaco van de Pol, Karsten Wolf:
MCC'2017 - The Seventh Model Checking Contest. 181-209
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.