default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarro Wimmel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j10]Eike Best, Raymond R. Devillers, Evgeny Erofeev, Harro Wimmel:
Target-oriented Petri Net Synthesis. Fundam. Informaticae 175(1-4): 97-122 (2020)- [j9]Harro Wimmel:
Presynthesis of bounded choice-free or fork-attribution nets. Inf. Comput. 271: 104482 (2020) - [i4]Uli Schlachter, Harro Wimmel:
Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete. CoRR abs/2002.04841 (2020)
2010 – 2019
- 2019
- [j8]Uli Schlachter
, Harro Wimmel:
Relabelling LTS for Petri Net Synthesis via Solving Separation Problems. Trans. Petri Nets Other Model. Concurr. 14: 222-254 (2019) - [i3]Harro Wimmel:
Synthesis of Reduced Asymmetric Choice Petri Nets. CoRR abs/1911.09133 (2019) - 2018
- [j7]Eike Best, Raymond R. Devillers, Uli Schlachter, Harro Wimmel:
Simultaneous Petri Net Synthesis. Sci. Ann. Comput. Sci. 28(2): 199-236 (2018) - [j6]Eike Best, Thomas Hujsa, Harro Wimmel:
Sufficient conditions for the marked graph realisability of labelled transition systems. Theor. Comput. Sci. 750: 101-116 (2018) - [c16]Uli Schlachter, Harro Wimmel:
A Geometric Characterisation of Event/State Separation. Petri Nets 2018: 99-116 - 2017
- [c15]Evgeny Erofeev, Harro Wimmel:
Reachability Graphs of Two-Transition Petri Nets. ATAED@Petri Nets/ACSD 2017: 39-54 - [c14]Uli Schlachter, Harro Wimmel:
k-Bounded Petri Net Synthesis from Modal Transition Systems. CONCUR 2017: 6:1-6:15 - 2016
- [c13]Eike Best, Evgeny Erofeev, Uli Schlachter, Harro Wimmel:
Characterising Petri Net Solvable Binary Words. Petri Nets 2016: 39-58 - [c12]Eike Best, Harro Wimmel:
Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs. RP 2016: 51-62 - 2013
- [j5]Eike Best, Harro Wimmel:
Structure Theory of Petri Nets. Trans. Petri Nets Other Model. Concurr. 7: 162-224 (2013) - [i2]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:
Model Checking Contest @ Petri Nets, Report on the 2013 edition. CoRR abs/1309.2485 (2013) - 2012
- [j4]Harro Wimmel, Karsten Wolf:
Applying CEGAR to the Petri Net State Equation. Log. Methods Comput. Sci. 8(3) (2012) - [j3]Fabrice Kordon, Alban Linard, Didier Buchs, Maximilien Colange, Sami Evangelista, Kai Lampka, Niels Lohmann, Emmanuel Paviot-Adet, Yann Thierry-Mieg, Harro Wimmel:
Report on the Model Checking Contest at Petri Nets 2011. Trans. Petri Nets Other Model. Concurr. 6: 169-196 (2012) - [i1]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:
Raw Report on the Model Checking Contest at Petri Nets 2012. CoRR abs/1209.2382 (2012) - 2011
- [c11]Harro Wimmel, Karsten Wolf:
Finding a Witness Path for Non-liveness in Free-Choice Nets. Petri Nets 2011: 189-207 - [c10]Harro Wimmel, Karsten Wolf:
Applying CEGAR to the Petri Net State Equation. TACAS 2011: 224-238 - 2010
- [c9]Olivia Oanea, Harro Wimmel, Karsten Wolf:
New Algorithms for Deciding the Siphon-Trap Property. Petri Nets 2010: 267-286 - [c8]Harro Wimmel:
Optimised Calculation of Symmetries for State Space Reduction. AWPN 2010: 112-117 - [c7]Harro Wimmel, Karsten Wolf:
Reachability Analysis via Net Structure. AWPN 2010: 118-123 - [c6]Peter Habermehl, Roland Meyer, Harro Wimmel:
The Downward-Closure of Petri Net Languages. ICALP (2) 2010: 466-477
2000 – 2009
- 2007
- [j2]Eike Best, Philippe Darondeau, Harro Wimmel:
Making Petri Nets Safe and Free of Internal Transitions. Fundam. Informaticae 80(1-3): 75-90 (2007) - 2006
- [c5]Eike Best, Javier Esparza, Harro Wimmel, Karsten Wolf:
Separability in Conflict-Free Petri Nets. Ershov Memorial Conference 2006: 1-18 - 2004
- [c4]Harro Wimmel:
Eliminating Internal Behaviour in Petri Nets. ICATPN 2004: 411-425 - [c3]Harro Wimmel:
Infinity of Intermediate States Is Decidable for Petri Nets. ICATPN 2004: 426-434 - 2000
- [c2]Eike Best, Harro Wimmel:
Reducing k -Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets. ICATPN 2000: 63-82
1990 – 1999
- 1998
- [j1]Lutz Priese, Harro Wimmel:
A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets. Theor. Comput. Sci. 206(1-2): 219-256 (1998) - 1997
- [c1]Harro Wimmel, Lutz Priese:
Algebraic Characterization of Petri Net Pomset Semantics. CONCUR 1997: 406-420
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 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:
