Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Uli Schlachter"'
Autor:
Alena Worschech, Uli Schlachter, Henning Wigger, Benedikt Hanke, Patrick Draheim, Frank Schuldt, Urte Brand, Theys Diekmann, Thomas Vogt, Karsten von Maydell
Publikováno v:
Energy Strategy Reviews, Vol 38, Iss , Pp 100744- (2021)
Flexible energy plants are one of the key requirements for future energy systems with high levels of fluctuating renewable energy. In the course of the transition to sustainable energy systems, regulatory frameworks and tax systems should promote car
Externí odkaz:
https://doaj.org/article/0074a255c7be4825b0ddd2b727abe036
Autor:
Eike Best, Uli Schlachter
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 189, Iss Proc. ICE 2015, Pp 53-67 (2015)
This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent, dedicated algorit
Externí odkaz:
https://doaj.org/article/1787b44c4a9b4517b0e973a70a39b2a5
Publikováno v:
Scientific Annals of Computer Science, Vol XXVIII, Iss 2, Pp 199-236 (2018)
Petri net synthesis deals with the problem whether, given a labelled transition system TS, one can find a Petri net N with an initial marking M0 such that the reachability graph of (N. M0) is isomorphic to TS. This may be preceded by a pre-synthesis
Batteries provide growing amounts of Frequency Containment Reserve (FCR) in the German electricity market. We examine the ideal battery capacity as well as the state of charge (SoC) setpoint for provision of FCR following a profit maximisation approa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::225be57ed44f9170dab75645dab09155
https://doi.org/10.1016/j.est.2020.101964
https://doi.org/10.1016/j.est.2020.101964
Publikováno v:
Acta informatica, 55 (7
This paper describes a synthesis procedure dedicated to the construction of choice-free Petri nets from finite persistent transition systems, whenever possible. Taking advantage of the properties of choice-free Petri nets, a two-step approach is prop
Autor:
Harro Wimmel, Uli Schlachter
Publikováno v:
Transactions on Petri Nets and Other Models of Concurrency XIV ISBN: 9783662606506
Petri net synthesis deals with finding an unlabelled Petri net with a reachability graph isomorphic to a given usually finite labelled transition system (LTS). If there is no solution for a synthesis problem, we use label splitting. This means that w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6d8856bb948e02086ad87790644cf65
https://doi.org/10.1007/978-3-662-60651-3_9
https://doi.org/10.1007/978-3-662-60651-3_9
Autor:
Uli Schlachter, Raymond Devillers
Publikováno v:
Application and Theory of Petri Nets and Concurrency ISBN: 9783319912677
Petri Nets
Petri Nets
In recent papers, general conditions were developed to characterise when and how a labelled transition system may be factorised into non-trivial factors. These conditions combine a local property (strong diamonds) and a global one (separation), the l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4067772bf0b7c2bb9a779ce27d0b7163
https://doi.org/10.1007/978-3-319-91268-4_5
https://doi.org/10.1007/978-3-319-91268-4_5
Autor:
Uli Schlachter, Harro Wimmel
Publikováno v:
Application and Theory of Petri Nets and Concurrency ISBN: 9783319912677
Petri Nets
Petri Nets
Region theory, as initiated by Ehrenfeucht and Rozenberg, allows the characterisation of the class of Petri net synthesisable finite labelled transition systems. Two kinds of problems need to be solved for such a synthesis, state separation problems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b276089123cddf25d82a4cb0f55617fa
https://doi.org/10.1007/978-3-319-91268-4_6
https://doi.org/10.1007/978-3-319-91268-4_6
Autor:
Uli Schlachter
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783319773124
LATA
LATA
We show that, given a finite lts, there is a minimal bounded Petri net over-approximation according to a structural preorder and present an algorithm to compute this over-approximation. This result is extended to subclasses of nets, namely pure Petri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c16f84343b66312669e4cacfeaae2e7e
https://doi.org/10.1007/978-3-319-77313-1_23
https://doi.org/10.1007/978-3-319-77313-1_23
Autor:
Uli Schlachter, Eric Badouel
Publikováno v:
Fundamenta Informaticae
Fundamenta Informaticae, 2017, 154 (1-4), pp.1-13. ⟨10.3233/FI-2017-1548⟩
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2017, 154 (1-4), pp.1-13. ⟨10.3233/FI-2017-1548⟩
Fundamenta Informaticae, 2017, 154 (1-4), pp.1-13. ⟨10.3233/FI-2017-1548⟩
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2017, 154 (1-4), pp.1-13. ⟨10.3233/FI-2017-1548⟩
International audience; Process discovery aims at constructing a model from a set of observations given by execution traces (a log). Petri nets are a preferred target model in that they produce a compact description of the system by exhibiting its co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e55ba64780e599adf90e4877fc874c2
https://inria.hal.science/hal-01599760/document
https://inria.hal.science/hal-01599760/document