CALL FOR PAPERS Process Mining and Petri net Synthesis 23 June 2008 - Xi'an, China
Satellite workshop of ATPN'2008 - 29th Int. Conf. on Applications and Theory of Petri nets and Other Models of Concurrency, and ACSD'2008 - 8th Int. Conf. on Application of Concurrency to System Design Conferences web site: http://ictt.xidian.edu.cn/atpn-acsd2008 Workshop web site: http://wwwis.win.tue.nl/~pmpns/ Important dates Submission of papers: 20 March 2008 Author notification: 1 May 2008 Camera ready version: 1 June 2008 Workshop: 23 June 2008 Scope During the last two decades, the research areas of process mining and Petri net synthesis have developed seemingly independently of each other. The area of Petri net synthesis (or the Theory of Regions) is concerned with the construction of Petri nets that compactly describe behavior, where this behavior is provided in terms of a state based model, such as a Transition System, or in terms of a formal language. The goal is to construct a Petri net that exactly mimics the behavior of the input model; hence the assumption is that input model contains complete information and indeed correctly described whatever system is modeled. If such a Petri net does not exist, synthesis algorithms typically produce the best estimation, i.e. a Petri net representing minimal behavior including the input model. The area of process mining is concerned with the analysis of business processes in general, where the basis of this analysis is formed by the recorded behavior of an information system in the form of an eventlog. Within the process mining context, process model discovery is concerned with the construction of Petri nets (or other models, such as EPCs) that give an abstract representation of the recorded behavior. As process mining is an emerging technique in industry, such event logs are usually taken from information systems, where each event occurs in the context of a case. In Petri net terms, such case is a possible execution of a Petri net, but in general, a case is considered to be a uniquely identifiable execution of a process, for example insurance claim 2043 in an insurance claim handling process. It is rarely known whether the information shown in the event log is complete and therefore, the goal of process mining is to analyze these event logs under the assumption that the information is incomplete. The goal of this workshop is to combine the two research areas of process mining and Petri net synthesis to benefit from ideas and concepts developed in both areas. Examples of possible ideas and concepts are: - the way that incomplete information is handled (e.g. relaxing the assumption that the complete behavior is known, or extending the information to make it complete); - the usability of the resulting Petri net model, i.e. when a Petri net is small and compact, but only represents 80% of the behavior, this is often a good result in Process Mining, but not desirable in Synthesis; - the identification of states in a process log, i.e. by identifying states, synthesis algorithms based on transition systems become applicable in the context of process mining. Furthermore, by identifying a regular language from the log (e.g. identifying recurring patterns of events), language-based synthesis algorithms become applicable; and - synthesizing Petri nets with minimal net behavior including the given log (see also above). Furthermore, a main objective is to integrate existing tools in these areas, such as ProM, VipTool and Petrify. Topics Recently, there have been several attempts to use ideas and algorithms from Petri net synthesis for process discovery and vice versa. However, many problems still stand today and therefore we invite people to submit papers, addressing both theory and practice on the following topics: - Process Mining o Discovering formal models from event logs o Quality measures for a process model when compared to the input model o Analyzing process logs for the purpose of finding state information - Petri net Synthesis o Synthesis algorithms based on logs o Completeness assumptions on the input o Synthesis of usable Petri nets o Synthesis of Workflow nets - Implementations o Tools for process mining o Tools for synthesis o Efficient implementations of existing theoretical results o Case studies or practical applications Submission of Papers Papers must be written in English, and be no longer than 15 pages, including references, appendices and figures. The paper must describe original work that has not been published before, nor submitted for publication elsewhere. Papers should be submitted by 20 March 2008 and follow the format of Springers Lecture Notes in Computer Science available at http://www.springer.de/comp/lncs/authors.html. The best papers will be invited for submission to a special issue of the Transactions on Petri Nets and Other Models of Concurrency (ToPNoC) published by Springer. Program Committee chairs Boudewijn van Dongen ([EMAIL PROTECTED]) Department of Mathematics and Computer Science Eindhoven University of Technology 5600MB Eindhoven, The Netherlands Robert Lorenz ([EMAIL PROTECTED]) Department of Applied Computer Science Catholic University Eichstätt-Ingolstadt 85072 Eichstätt, Germany Philippe Darondeau ([EMAIL PROTECTED]) IRISA Campus de Beaulieu F-35042 Rennes cedex, France Jianmin Wang ([EMAIL PROTECTED]) School of Software, Tsinghua University, 100084 Beijing, China PC members (tentative) Boudewijn van Dongen (The Netherlands) Robert Lorenz (Germany) Jordi Cortadella (Spain) Vladimir Rubin (Germany) Michele Pinna (Italy) Philippe Darondeau (France) Jan Mendling (Australia) Kristian Bisgaard Lassen (Denmark) Wil van der Aalst (The Netherlands) Luciano Lavagno (Italy) Alex Yakovlev (UK) Akhil Kumar (USA) Karsten Wolf (geb. Schmidt) (Germany) Alessandro Giua (Italy) Carla Seatzu (Italy) Gabriel Juhás (Slovakia) Jörg Desel (Germany) Ana Karla Alves de Medeiros (The Netherlands) Peter van den Brand (The Netherlands) Christian Gunther (The Netherlands) Anne Rozinat (The Netherlands) Eric Verbeek (The Netherlands) Christian Koelbl (Germany) Ronnie Mans (The Netherlands) Minseok Song (The Netherlands) Antonella Guzzo (Italy) Stefanie Rinderle (Germany) Sebastian Mauser (Germany) Robin Bergenthum (Germany) ---- [[ Petri Nets World: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/ ]] [[ Mailing list FAQ: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/pnml/faq.html ]] [[ Post messages/summary of replies: ]] [[ [email protected] ]]
