default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUli Schlachter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i1]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
- [j5]Uli Schlachter
, Harro Wimmel:
Relabelling LTS for Petri Net Synthesis via Solving Separation Problems. Trans. Petri Nets Other Model. Concurr. 14: 222-254 (2019) - 2018
- [b1]Uli Schlachter:
Petri net synthesis and modal specifications. University of Oldenburg, Germany, 2018 - [j4]Eike Best, Raymond R. Devillers, Uli Schlachter:
Bounded choice-free Petri net synthesis: algorithmic issues. Acta Informatica 55(7): 575-611 (2018) - [j3]Eike Best, Raymond R. Devillers, Uli Schlachter, Harro Wimmel:
Simultaneous Petri Net Synthesis. Sci. Ann. Comput. Sci. 28(2): 199-236 (2018) - [c11]Raymond R. Devillers, Uli Schlachter:
Factorisation of Petri Net Solvable Transition Systems. Petri Nets 2018: 82-98 - [c10]Uli Schlachter, Harro Wimmel:
A Geometric Characterisation of Event/State Separation. Petri Nets 2018: 99-116 - [c9]Uli Schlachter:
Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets. LATA 2018: 296-307 - 2017
- [j2]Éric Badouel, Uli Schlachter:
Incremental Process Discovery using Petri Net Synthesis. Fundam. Informaticae 154(1-4): 1-13 (2017) - [j1]Kamila Barylska, Eike Best, Uli Schlachter, Valentin Spreckels:
Properties of Plain, Pure, and Safe Petri Nets. Trans. Petri Nets Other Model. Concurr. 12: 1-18 (2017) - [c8]Uli Schlachter, Valentin Spreckels:
Synthesis of Labelled Transition Systems into Equal-Conflict Petri Nets. ATAED@Petri Nets/ACSD 2017: 122-130 - [c7]Uli Schlachter, Harro Wimmel:
k-Bounded Petri Net Synthesis from Modal Transition Systems. CONCUR 2017: 6:1-6:15 - [c6]Eike Best, Raymond R. Devillers, Uli Schlachter:
A Graph-Theoretical Characterisation of State Separation. SOFSEM 2017: 163-175 - 2016
- [c5]Eike Best, Evgeny Erofeev, Uli Schlachter, Harro Wimmel:
Characterising Petri Net Solvable Binary Words. Petri Nets 2016: 39-58 - [c4]Uli Schlachter:
Petri Net Synthesis for Restricted Classes of Nets. Petri Nets 2016: 79-97 - [c3]Uli Schlachter:
Bounded Petri Net Synthesis from Modal Transition Systems is Undecidable. CONCUR 2016: 15:1-15:14 - 2015
- [c2]Eike Best, Uli Schlachter:
Analysis of Petri Nets and Transition Systems. ICE 2015: 53-67 - 2013
- [c1]Oliver Kramer, Uli Schlachter, Valentin Spreckels:
An adaptive penalty function with meta-modeling for constrained problems. IEEE Congress on Evolutionary Computation 2013: 1350-1354
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 2025-01-04 03:37 CET 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:
