License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TIME.2017.2
URN: urn:nbn:de:0030-drops-79266
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7926/
Go to the corresponding LIPIcs Volume Portal

Esparza, Javier

Advances in Quantitative Analysis of Free-Choice Workflow Petri Nets (Invited Talk)

pdf-format:
LIPIcs-TIME-2017-2.pdf (0.3 MB)

Abstract

We survey recent results on the development of efficient algorithms for the quantitative analysis of business processes modeled as workflow Petri nets. The algorithms can be applied to any workflow net, but have polynomial runtime in the free-choice case.

BibTeX - Entry

@InProceedings{esparza:LIPIcs:2017:7926,
  author =	{Javier Esparza},
  title =	{{Advances in Quantitative Analysis of Free-Choice Workflow Petri Nets (Invited Talk)}},
  booktitle =	{24th International Symposium on Temporal Representation and Reasoning (TIME 2017)},
  pages =	{2:1--2:6},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-052-1},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{90},
  editor =	{Sven Schewe and Thomas Schneider and Jef Wijsen},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7926},
  URN =		{urn:nbn:de:0030-drops-79266},
  doi =		{10.4230/LIPIcs.TIME.2017.2},
  annote =	{Keywords: Free-choice Petri Nets, concurrency theory, quantitative verification}
}

Keywords: Free-choice Petri Nets, concurrency theory, quantitative verification
Collection: 24th International Symposium on Temporal Representation and Reasoning (TIME 2017)
Issue Date: 2017
Date of publication: 25.09.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI