• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта

Семинар лаборатории ПОИС: проф. Йорг Дезель

Dr. Jörg Desel
Professor at the FernUniversität in Hagen, Fakultät für Mathematik und Informatik. Hagen, Germany.

Jörg Desel is a full professor for informatics at FernUniversität in Hagen, the leading distance university in Germany.

He studied at the University of Bonn and received his doctorate degree from Technical University Munich in 1992 and his Habilitation in 1997 from Humboldt-Universität zu Berlin. His research interest concentrates on theory and application of process modeling languages, with an emphasis on semantics, analysis and synthesis of process models. From 1998 until 2010, he had a position as a full professor at the Catholic University in Eichstätt, Germany.

Jörg Desel (co-)authored or (co-)edited 17 books, published more than 40 papers in journals or books and has numerous further publications. He is a member of the steering committees of the International Petri Net Conference series, of the Business Process Management conference series and of the Application of Concurrency to System Design conference series. He was the editor in chief of the PetriNet newsletter and is a member of the editorial board of the International Journal of Business Process Integration and Management. He has organized several conferences, including the 4th International Advanced Course on Petri Nets, chaired eight program committees and was a member of numerous program committees.

Jörg Desel is a member of the executive committee of the Gesellschaft für Informatik, and he is a member of four steering committees within the Gesellschaft für Informatik.
On Negotiation as Concurrency Primitive
October 13th, 2014 - 18:10 - aud. 402 Add to Calendar
Negotiations are a novel model of concurrency close to Petri nets with multiparty negotiation as primitive. We study the problems of soundness of negotiations and of computing a summary that comprises the result of a negotiation of multiple steps in one step. Therefore, we show that reduction rules can be applied to sound negotiations yielding, for particular subclasses of negotiations, polynomial algorithms to solve the soundness and summarization problems. This is a joint work with Javier Esparza, combining papers from CONCUR 2013 and FOSSACS 2014.
Slides:  Moskau1.pdf
A Survey on Synthesis of Petri Nets from Partially Ordered Runs
October 16th, 2014 - 18:10 - aud. 317 (lecture hall Descartes) Add to Calendar
Synthesis of Petri nets has been a hot topic in Petri net research with important applications in circuit design and in business process management (with strong relations to workflow mining). Whereas usually, from a given Petri net model its behavior can be obtained, synthesis constructs a Petri net from a given behavior. Our behavioral notion are partially ordered runs, formally given by partial words. The synthesis techniques presented apply verification techniques, i.e., techniques to verify that a given partial word actually describes a possible behavior of a net. Whereas this problem is very simple for occurrence sequences and for state graphs, it is nontrivial for partial orders. We demonstrate how to solve both the synthesis and the verification problem using the technique of token flows.
Slides:  Moskau2.pdf

 

Нашли опечатку?
Выделите её, нажмите Ctrl+Enter и отправьте нам уведомление. Спасибо за участие!