default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonny Tredup
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j7]Raymond R. Devillers, Ronny Tredup:
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues. Fundam. Informaticae 187(2-4): 139-165 (2022)- [j6]Raymond R. Devillers, Ronny Tredup:
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues. Fundam. Informaticae 187(2-4): 167-196 (2022) - [j5]Raymond R. Devillers, Ronny Tredup:
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets. Fundam. Informaticae 189(3-4): 261-296 (2022) - [c21]Raymond R. Devillers, Ronny Tredup:
Synthesis of Inhibitor-Reset Petri Nets: Algorithmic and Complexity Issues. Petri Nets 2022: 213-235 - [c20]Raymond R. Devillers, Ronny Tredup:
Complexity of Distributed Petri Net Synthesis. TASE 2022: 15-28 - [i10]Raymond R. Devillers, Ronny Tredup:
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets. CoRR abs/2203.09233 (2022) - 2021
- [b1]Ronny Tredup:
Zur Komplexität der Synthese von Petri-Netzen. University of Rostock, Germany, 2021 - [j4]Ronny Tredup:
The Complexity of Synthesis of b-Bounded Petri Nets. Fundam. Informaticae 183(1-2): 125-167 (2021) - [j3]Ronny Tredup, Evgeny Erofeev:
On the parameterized complexity of the synthesis of Boolean nets with restricted place environments. Theor. Comput. Sci. 890: 36-69 (2021) - [j2]Ronny Tredup:
The Complexity of Synthesizing sf nop-Equipped Boolean Petri Nets from g-Bounded Inputs. Trans. Petri Nets Other Model. Concurr. 15: 101-125 (2021) - [c19]Ronny Tredup, Sophie Wallner:
The Reachability Problem for Acyclic Join-Free Petri nets is NP-complete. PNSE@Petri Nets 2021: 123-134 - [c18]Ronny Tredup:
Edge, Event and State Removal: The Complexity of Some Basic Techniques that Make Transition Systems Petri Net Implementable. Petri Nets 2021: 253-273 - [c17]Ronny Tredup:
Synthesis of Petri Nets with Restricted Place-Environments: Classical and Parameterized. Petri Nets 2021: 292-311 - [i9]Ronny Tredup:
The Complexity of Synthesis of b-Bounded Petri Nets. CoRR abs/2106.15256 (2021) - [i8]Raymond R. Devillers, Ronny Tredup:
Some Basic Techniques allowing Petri Net Synthesis: Complexity and Algorithmic Issues. CoRR abs/2112.03605 (2021) - [i7]Raymond R. Devillers, Ronny Tredup:
Synthesis of Pure and Impure Petri nets With Restricted Place-environments: Complexity Issues. CoRR abs/2112.03608 (2021) - 2020
- [j1]Christian Rosenke, Ronny Tredup:
The complexity of synthesizing elementary net systems relative to natural parameters. J. Comput. Syst. Sci. 110: 37-54 (2020) - [c16]Ronny Tredup, Evgeny Erofeev:
On the Complexity of Synthesis of nop-Free Boolean Petri Nets. ATAED@Petri Nets 2020: 66-84 - [c15]Ronny Tredup, Evgeny Erofeev:
The Complexity of Boolean State Separation. ICTAC 2020: 123-142 - [c14]Evgeny Erofeev, Ronny Tredup:
Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm. ICTAC 2020: 143-160 - [c13]Ronny Tredup:
Finding an Optimal Label-Splitting to Make a Transition System Petri Net Implementable: a Complete Complexity Characterization. ICTCS 2020: 131-144 - [c12]Ronny Tredup:
The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets. RP 2020: 148-163 - [c11]Ronny Tredup:
Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems. SOFSEM 2020: 223-235 - [c10]Ronny Tredup, Evgeny Erofeev:
On the Parameterized Complexity of d-Restricted Boolean Net Synthesis. TAMC 2020: 226-238 - [c9]Ronny Tredup, Evgeny Erofeev:
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency. ICE 2020: 78-95 - [i6]Ronny Tredup, Evgeny Erofeev:
On the Parameterized Complexity of Synthesizing Boolean Petri Nets With Restricted Dependency (Technical Report). CoRR abs/2007.12372 (2020) - [i5]Ronny Tredup, Evgeny Erofeev:
The Complexity of Boolean State Separation (Technical Report). CoRR abs/2010.00825 (2020)
2010 – 2019
- 2019
- [c8]Ronny Tredup, Christian Rosenke:
On the Hardness of Synthesizing Boolean Nets. ATAED@Petri Nets/ACSD 2019: 71-86 - [c7]Ronny Tredup:
Hardness Results for the Synthesis of b-bounded Petri Nets. Petri Nets 2019: 127-147 - [c6]Ronny Tredup:
Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets. Petri Nets 2019: 148-168 - [c5]Ronny Tredup:
Synthesis of Structurally Restricted b-bounded Petri Nets: Complexity Results. RP 2019: 202-217 - [c4]Ronny Tredup, Christian Rosenke:
The Complexity of Synthesis for 43 Boolean Petri Net Types. TAMC 2019: 615-634 - [c3]Ronny Tredup:
Tracking Down the Bad Guys: Reset and Set Make Feasibility for Flip-Flop Net Derivatives NP-complete. ICE 2019: 20-37 - [i4]Ronny Tredup:
Hardness Results for the Synthesis of b-bounded Petri Nets (Technical Report). CoRR abs/1904.01094 (2019) - [i3]Ronny Tredup:
The Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (Technical Report). CoRR abs/1911.05834 (2019) - 2018
- [c2]Ronny Tredup, Christian Rosenke, Karsten Wolf:
Elementary Net Synthesis Remains NP-Complete Even for Extremely Simple Inputs. Petri Nets 2018: 40-59 - [c1]Ronny Tredup, Christian Rosenke:
Narrowing down the Hardness Barrier of Synthesizing Elementary Net Systems. CONCUR 2018: 16:1-16:15 - [i2]Ronny Tredup, Christian Rosenke:
Towards Completely Characterizing the Complexity of Boolean Nets Synthesis. CoRR abs/1806.03703 (2018) - 2017
- [i1]Christian Rosenke, Ronny Tredup:
The Hardness of Synthesizing Elementary Net Systems from Highly Restricted Inputs. CoRR abs/1711.00220 (2017)
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:48 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:
