Harro Wimmel

According to our database, Harro Wimmel authored at least 29 papers between 1997 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Presynthesis of bounded choice-free or fork-attribution nets.

Harro Wimmel

Inf. Comput., 2020

Target-oriented Petri Net Synthesis.

Eike Best, Raymond Devillers, Evgeny Erofeev, Harro Wimmel

Fundam. Informaticae, 2020

Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete.

Uli Schlachter, Harro Wimmel

CoRR, 2020

2019

Relabelling LTS for Petri Net Synthesis via Solving Separation Problems.

Uli Schlachter, Harro Wimmel

Trans. Petri Nets Other Model. Concurr., 2019

Synthesis of Reduced Asymmetric Choice Petri Nets.

Harro Wimmel

CoRR, 2019

2018

Sufficient conditions for the marked graph realisability of labelled transition systems.

Eike Best, Thomas Hujsa, Harro Wimmel

Theor. Comput. Sci., 2018

Simultaneous Petri Net Synthesis.

Eike Best, Raymond Devillers, Uli Schlachter, Harro Wimmel

Sci. Ann. Comput. Sci., 2018

A Geometric Characterisation of Event/State Separation.

Uli Schlachter, Harro Wimmel

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

2017

k-Bounded Petri Net Synthesis from Modal Transition Systems.

Uli Schlachter, Harro Wimmel

Proceedings of the 28th International Conference on Concurrency Theory, 2017

Reachability Graphs of Two-Transition Petri Nets.

Evgeny Erofeev, Harro Wimmel

Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2017 Satellite event of the conferences: 38th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2017 and 17th International Conference on Application of Concurrency to System Design ACSD 2017, 2017

2016

Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs.

Eike Best, Harro Wimmel

Proceedings of the Reachability Problems - 10th International Workshop, 2016

Characterising Petri Net Solvable Binary Words.

Eike Best, Evgeny Erofeev, Uli Schlachter, Harro Wimmel

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2016

2013

Structure Theory of Petri Nets.

Eike Best, Harro Wimmel

Trans. Petri Nets Other Model. Concurr., 2013

Model Checking Contest @ Petri Nets, Report on the 2013 edition.

Fabrice Kordon, Alban Linard, Marco Beccuti, Didier Buchs, Lukasz Fronc, Lom-Messan Hillah, Francis Hulin-Hubard, Fabrice Legond-Aubry, Niels Lohmann, Alexis Marechal, Emmanuel Paviot-Adet, Franck Pommereau, César Rodríguez, Christian Rohr, Yann Thierry-Mieg, Harro Wimmel, Karsten Wolf

CoRR, 2013

2012

Report on the Model Checking Contest at Petri Nets 2011.

Fabrice Kordon, Alban Linard, Didier Buchs, Maximilien Colange, Sami Evangelista, Kai Lampka, Niels Lohmann, Emmanuel Paviot-Adet, Yann Thierry-Mieg, Harro Wimmel

Trans. Petri Nets Other Model. Concurr., 2012

Raw Report on the Model Checking Contest at Petri Nets 2012

Fabrice Kordon, Alban Linard, Didier Buchs, Maximilien Colange, Sami Evangelista, Lukasz Fronc, Lom-Messan Hillah, Niels Lohmann, Emmanuel Paviot-Adet, Franck Pommereau, Christian Rohr, Yann Thierry-Mieg, Harro Wimmel, Karsten Wolf

CoRR, 2012

2011

Applying CEGAR to the Petri Net State Equation.

Harro Wimmel, Karsten Wolf

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

Finding a Witness Path for Non-liveness in Free-Choice Nets.

Harro Wimmel, Karsten Wolf

Proceedings of the Applications and Theory of Petri Nets - 32nd International Conference, 2011

2010

The Downward-Closure of Petri Net Languages.

Peter Habermehl, Roland Meyer, Harro Wimmel

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Reachability Analysis via Net Structure.

Harro Wimmel, Karsten Wolf

Proceedings of the 17th German Workshop on Algorithms and Tools for Petri Nets, 2010

Optimised Calculation of Symmetries for State Space Reduction.

Harro Wimmel

Proceedings of the 17th German Workshop on Algorithms and Tools for Petri Nets, 2010

New Algorithms for Deciding the Siphon-Trap Property.

Olivia Oanea, Harro Wimmel, Karsten Wolf

Proceedings of the Applications and Theory of Petri Nets, 2010

2007

Making Petri Nets Safe and Free of Internal Transitions.

Eike Best, Philippe Darondeau, Harro Wimmel

Fundam. Informaticae, 2007

2006

Separability in Conflict-Free Petri Nets.

Eike Best, Javier Esparza, Harro Wimmel, Karsten Wolf

Proceedings of the Perspectives of Systems Informatics, 2006

2004

Infinity of Intermediate States Is Decidable for Petri Nets.

Harro Wimmel

Proceedings of the Applications and Theory of Petri Nets 2004, 2004

Eliminating Internal Behaviour in Petri Nets.

Harro Wimmel

Proceedings of the Applications and Theory of Petri Nets 2004, 2004

2000

Reducing k -Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets.

Eike Best, Harro Wimmel

Proceedings of the Application and Theory of Petri Nets 2000, 2000

1998

A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets.

Lutz Priese, Harro Wimmel

Theor. Comput. Sci., 1998

1997

Algebraic Characterization of Petri Net Pomset Semantics.

Harro Wimmel, Lutz Priese

Proceedings of the CONCUR '97: Concurrency Theory, 1997