Abstract
This paper introduces the online tool travis. The main application of travis is the synthesis and the analysis of Petri net models with final states. Using travis we can load or specify a labeled transition system and toggle an arbitrary set of states to be final. travis can also load and handle event logs to start the synthesis procedure. Fix a transition system or an event log, travis is able to synthesize a k-bounded Petri net model with a set of final markings related to the set of specified final states. Furthermore, travis can synthesize a so-called neat place for any k-bounded Petri net model at hand if such a place exists. A neat place is marked if and only if the Petri net is in a final state. The computation of neat places is a strong tool to analyze final states of process models.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
van der Aalst, W.M.P., van Dongen, B.F., Günther, C.W., Rozinat, A., Weijters, T.: ProM: the process mining toolkit. In: de Medeiros, A.K.A., Weber, B. (eds.) Proceedings of the Business Process Management Demonstration Track (BPMDemos 2009), Ulm, Germany, 8 September 2009, vol. 489. CEUR. http://www.promtools.org/doku.php
Allweyer, T.: Kollaborationen, Choreographien und Konversationen in BPMN 2.0 - Erweiterte Konzepte zur Modellierung übergreifender Geschäftsprozesse. Working Paper. Kaiserslautern University of Applied Sciences Kaiserslautern (2009)
Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. Texts in Theoretical Computer Science. Springer, Heidelberg (2015)
Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of Petri nets from scenarios with VipTool. In: Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 388–398. Springer, Heidelberg (2008). doi:10.1007/978-3-540-68746-7_25
Best, E., Schlachter, U.: Analysis of Petri nets and transition systems. In: Knight, S., Lanese, I., Lluch-Lafuente, A., Vieira, H.T. (eds.) Proceedings 8th Interaction and Concurrency Experience, ICE 2015, Grenoble, France, 4–5, vol. 189, pp. 53–67. EPTCS (2015). https://github.com/CvO-Theory/apt
Carmona, J., Cortadella, J., Kishinevsky, M., Kondratyev, A., Lavagno, L., Yakovlev, A.: A symbolic algorithm for the synthesis of bounded Petri nets. In: Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 92–111. Springer, Heidelberg (2008). doi:10.1007/978-3-540-68746-7_10
Carmona, J., Cortadella, J., Kishinevsky, M.: A region-based algorithm for discovering Petri nets from event logs. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 358–373. Springer, Heidelberg (2008). doi:10.1007/978-3-540-85758-7_26
Carmona, J., Cortadella, J., Kishinevsky, M.: Genet: a tool for the synthesis and mining of Petri nets. In: Ninth International Conference on Application of Concurrency to System Design, ACSD 2009, Augsburg, Germany, 1–3 July 2009
Carmona, J., Cortadella, J., Kishinevsky, M.: New region-based algorithms for deriving bounded Petri nets. IEEE Trans. Comput. 59(3), 371–384 (2010)
Cortadella, J., Kishinevsky, M., Lavagno, L., Yakovlev, A.: Deriving Petri nets from finite transition systems. IEEE Trans. Comput. 47(8), 859–882 (1998)
Cortadella, J., Kishinevsky, M., Kondratyev, L., Lavagno, L., Yakovlev, A.: Petrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers. IEICE Trans. Inf. Syst. E80–D(3), 315–325 (1997). http://www.cs.upc.edu/ jordicf/petrify/
Desel, J., Reisig, W.: The synthesis problem of Petri nets. Acta Informatikca 33, 279–315 (1996)
Eckleder, A., Freytag, T.: WoPeD - a tool for teaching, analyzing and visualizing workflow nets. Petri Net Newslett. 75 (2008). http://woped.dhbw-karlsruhe.de/woped/
Heiner, M., Schwarick, M., Wegener, J.-T.: Charlie – an extensible Petri net analysis tool. In: Devillers, R., Valmari, A. (eds.) PETRI NETS 2015. LNCS, vol. 9115, pp. 200–211. Springer, Cham (2015). doi:10.1007/978-3-319-19488-2_10. http://www-dssz.informatik.tu-cottbus.de/DSSZ/Software/Charlie
Kindler, E.: PNML: concept, status and future directions. Entwurf Komplexer Automatisierungssysteme (EKA) 9, 35–55 (2006)
Meis, B., Bergenthum, R., Desel, J.: Synthesis of elementary net systems with final configurations. In: van der Aalst, W.M.P., Bergenthum, R., Carmona, J. (eds.) Workshop on Algorithms & Theories for the Analysis of Event Data (ATAED 2016), Torun, Poland, pp. 47–57 (2016)
Meis, B., Bergenthum, R., Desel, J.: Synthesis of Petri nets with final states. Submitted
Verbeek, H.M.W., Buijs, J.C.A.M., Dongen, B.F., Aalst, W.M.P.: XES, XESame, and ProM 6. In: Soffer, P., Proper, E. (eds.) CAiSE Forum 2010. LNBIP, vol. 72, pp. 60–75. Springer, Heidelberg (2011). doi:10.1007/978-3-642-17722-4_5
Wolf, K., Lohmann, N.: LoLA - a low level petri net analyzer (2014). http://home.gna.org/service-tech/lola/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Meis, B., Bergenthum, R., Desel, J. (2017). travis - An Online Tool for the Synthesis and Analysis of Petri Nets with Final States. In: van der Aalst, W., Best, E. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2017. Lecture Notes in Computer Science(), vol 10258. Springer, Cham. https://doi.org/10.1007/978-3-319-57861-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-57861-3_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57860-6
Online ISBN: 978-3-319-57861-3
eBook Packages: Computer ScienceComputer Science (R0)