Uli Schlachter

Orcid: 0000-0002-5063-025X

According to our database1, Uli Schlachter authored at least 18 papers between 2013 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

2019
Relabelling LTS for Petri Net Synthesis via Solving Separation Problems.
Trans. Petri Nets Other Model. Concurr., 2019

2018
Petri net synthesis and modal specifications.
PhD thesis, 2018

Simultaneous Petri Net Synthesis.
Sci. Ann. Comput. Sci., 2018

Bounded choice-free Petri net synthesis: algorithmic issues.
Acta Informatica, 2018

Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets.
Proceedings of the Language and Automata Theory and Applications, 2018

A Geometric Characterisation of Event/State Separation.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

Factorisation of Petri Net Solvable Transition Systems.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

2017
Properties of Plain, Pure, and Safe Petri Nets.
Trans. Petri Nets Other Model. Concurr., 2017

Incremental Process Discovery using Petri Net Synthesis.
Fundam. Informaticae, 2017

A Graph-Theoretical Characterisation of State Separation.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

k-Bounded Petri Net Synthesis from Modal Transition Systems.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Synthesis of Labelled Transition Systems into Equal-Conflict Petri Nets.
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
Bounded Petri Net Synthesis from Modal Transition Systems is Undecidable.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

Petri Net Synthesis for Restricted Classes of Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2016

Characterising Petri Net Solvable Binary Words.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2016

2015
Analysis of Petri Nets and Transition Systems.
Proceedings of the Proceedings 8th Interaction and Concurrency Experience, 2015

2013
An adaptive penalty function with meta-modeling for constrained problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013


  Loading...