| Verification of Token-Scaling Models using an Under-Approximation. | 0 | 0.34 | 2020 |
| Presentation of the 9th Edition of the Model Checking Contest. | 0 | 0.34 | 2019 |
| Solving E (φUψ) using the CEGAR Approach. | 0 | 0.34 | 2019 |
| Synthesis for Various Petri Net Classes with Union/Find. | 0 | 0.34 | 2019 |
| MCC'2017 - The Seventh Model Checking Contest. | 1 | 0.35 | 2018 |
| Petri Net Model Checking with LoLA 2. | 0 | 0.34 | 2018 |
| Interleaving Based Model Checking of Concurrency and Causality. | 0 | 0.34 | 2018 |
| A Simple Abstract Interpretation for Petri Net Queries. | 0 | 0.34 | 2018 |
| Petri Net Synthesis with Union/Find. | 0 | 0.34 | 2018 |
| Elementary Net Synthesis Remains NP-Complete Even for Extremely Simple Inputs. | 0 | 0.34 | 2018 |
| Model Checking Concurrency and Causality. | 0 | 0.34 | 2017 |
| Running LoLA 2.0 in a Model Checking Competition. | 5 | 0.46 | 2016 |
| Model Checking Contest @ Petri Nets, Report on the 2013 edition. | 5 | 0.70 | 2013 |
| Stubborn sets for simple linear time properties | 3 | 0.37 | 2012 |
| Raw Report on the Model Checking Contest at Petri Nets 2012 | 6 | 0.63 | 2012 |
| Reducing Adapter Synthesis to Controller Synthesis | 34 | 1.06 | 2012 |
| Finding a witness path for non-liveness in free-choice nets | 0 | 0.34 | 2011 |
| Decidability results for choreography realization | 7 | 0.46 | 2011 |
| Guaranteeing Weak Termination in Service Discovery | 2 | 0.37 | 2011 |
| Compact Representations and Efficient Algorithms for Operating Guidelines | 11 | 0.59 | 2011 |
| Analysis on demand: Instantaneous soundness checking of industrial business process models | 82 | 2.50 | 2011 |
| A-posteriori detection of sensor infrastructure errors in correlated sensor data and business workflows | 5 | 0.43 | 2011 |
| Applying CEGAR to the petri net state equation | 8 | 0.52 | 2011 |
| Multiparty Contracts: Agreeing and Implementing Interorganizational Processes | 44 | 1.27 | 2010 |
| Reachability Analysis via Net Structure. | 0 | 0.34 | 2010 |
| Service Discovery Using Communication Fingerprints | 2 | 0.37 | 2010 |
| How to implement a theory of correctness in the area of business processes and services | 8 | 0.59 | 2010 |
| New algorithms for deciding the siphon-trap property | 8 | 0.47 | 2010 |
| Artifact-Centric Choreographies | 14 | 0.80 | 2010 |
| Web Services and Formal Methods: 5th International Workshop, WS-FM 2008, Milan, Italy, September 4-5, 2008, Revised Selected Papers | 12 | 0.81 | 2009 |
| Petrifying Operating Guidelines for Services | 6 | 0.64 | 2009 |
| Applications and Theory of Petri Nets, 30th International Conference, PETRI NETS 2009, Paris, France, June 22-26, 2009. Proceedings | 19 | 1.91 | 2009 |
| Does My Service Have Partners? | 53 | 2.05 | 2009 |
| Realizability is controllability | 11 | 0.65 | 2009 |
| A theory of service behavior | 0 | 0.34 | 2009 |
| Service Interaction: Patterns, Formalization, and Analysis | 64 | 2.20 | 2009 |
| A finite representation of all substitutable services and its applications | 0 | 0.34 | 2009 |
| Verifying Deadlock- and Livelock Freedom in an SOA Scenario | 3 | 0.39 | 2009 |
| Another Approach to Service Instance Migration | 7 | 0.47 | 2009 |
| Deciding service composition and substitutability using extended operating guidelines | 19 | 0.82 | 2009 |
| Instantaneous Soundness Checking of Industrial Business Process Models | 81 | 2.36 | 2009 |
| Set Algebra for Service Behavior: Applications and Constructions | 7 | 0.57 | 2009 |
| An efficient necessary condition for compatibility | 2 | 0.39 | 2009 |
| Covering Places and Transitions in Open Nets | 4 | 0.47 | 2008 |
| An Approach to Tackle Livelock-Freedom in SOA | 0 | 0.34 | 2008 |
| Extending the compatibility notion for abstract WS-BPEL processes | 34 | 1.21 | 2008 |
| 15th German Workshop on Algorithms and Tools for Petri Nets, Algorithmen und Werkzeuge für Petrinetze, AWPN 2008, Rostock, Germany, September 26-27, 2008. Proceedings | 15 | 1.99 | 2008 |
| Can I find a partner? Undecidability of partner existence for open nets | 21 | 0.90 | 2008 |
| Generating Petri net state spaces | 50 | 1.96 | 2007 |
| An algorithm for matching non-deterministic services with operating guidelines | 13 | 0.74 | 2007 |
