VIP Tool

A partial order based tool for modelling, simulation, validation and verification of place/transition Petri nets

VipTool is a tool for modelling, simulation, validation and verification of systems using place/transition Petri nets (p/t-nets). It implements the research done in a project named VIP (Verification of Information systems by evaluating partially-ordered Petri net runs) that was sponsored by the German Research Society (DFG). The main concern of this project is to establish a simulation and modelling concept for business processes given by Petri nets, which is based on the generation and evaluation of partially ordered execution runs (processes) instead of totally ordered sequences of transition occurrences. VipTool provides a comprehensive bundle of methods concerned with causality and concurrency modelled by partially ordered runs of p/t-nets. Namely, functionalities for synthesis, unfolding (combined with respective validation) and testing of executability are covered by VipTool.

• VipTool (ZIP 3 MB) (6.0.3) (ZIP, 2,8 MB). Requires at least Oracle Java 7.

There are other projects based on the VipTool Editor:

• MuPSi - a Multitouch Petrinet Simulator for interactive creation and simulation of Petri Net
• AMSEL - a platform which supports the learning and creation of algorithms

There are also versions developed during courses and theses:

• Troynet (ZIP 17 MB) - an editor for faithful Petri nets, complying with; Reisig, Wolfgang; Petrinetze, Modellierungstechnik, Analysemethoden, Fallstudien, Wiesbaden 2010.

• Test Languages (ZIP 230 KB) for the ToPNoC article “Comparion of Different Algorithms to Synthesize a Petri Net from a Partial Language”.
• Insurance Examples (ZIP 16 KB)

Note: To run the examples, just unzip the file to a directory and open the project file (*.prj) with the viptool 'Load Project' menu entry.

• Vip Tool User Guide (PDF 506 KB)

• VipTool2PNML: Converts VipTool *.pnml files into ProM/WoPed compatible PNML files.

• R. Bergenthum, J. Desel, S. Mauser: Comparison of Different Algorithms to Synthesize a Petri Net from a Partial Language. Transactions on Petri Nets and Other Models of Concurrency, to appear 2009.
• R. Bergenthum, S. Mauser: Synthesis of Petri Nets from Infinite Partial Languages with VipTool. 15. Workshop Algorithmen und Werkzeuge für Petrinetze (AWPN), Rostock, 2008.
• R. Bergenthum, J. Desel, R. Lorenz, S. Mauser: Synthesis of Petri Nets from Finite Partial Languages. Fundamenta Informaticae, Volume 88, Number 4, 437-468, IOS Press, 2008.
• R. Bergenthum, J.Desel, R.Lorenz, S. Mauser: Synthesis of Petri Nets from Infinite Partial Languages. J. Billington, Z. Duan, M. Koutny (Hrsg.): Proceedings of the 8th international conference on Application of Concurrency to System Design (ACSD), 170-179, IEEE Computer Society, 2008.
• R. Bergenthum, J.Desel, R.Lorenz, S. Mauser: Synthesis of Petri Nets from Scenarios with VipTool. K. v. Hee, R. Valk (Hrsg.): Application and Theory of Petri Nets (Petri Nets), Proceedings of the 29th International Conference on Application and Theory of Petri Nets, LNCS 5062, 388-398, Springer, 2008.
• R. Bergenthum, R.Lorenz, S. Mauser: Faster Unfolding of General Petri Nets Based on Token Flows. K. v. Hee, R. Valk (Hrsg.): Application and Theory of Petri Nets (Petri Nets), Proceedings of the 29th International Conference on Application and Theory of Petri Nets, LNCS 5062, 388-398, Springer, 2008.
• R. Bergenthum, S. Mauser: Comparison of Different Algorithms to Synthesize a Petri Net from a Partial Language. CHINA 2008 satellite workshop of ICATPN, 2008.
• Bergenthum, R., Mauser, S.: Experimental Results on the Synthesis of Petri Nets from Partial Languages. Petri Net Newsletter vol. 73, pages 3 - 10, 2007.
• Lorenz, R., Bergenthum, R., Desel, J., Mauser, S.: Synthesis of Petri Nets from Finite Partial Languages. Proceedings of ACSD 2007, IEEE Computer Society, pages 157 - 166, 2007.
• Bergenthum, R., Desel, J., Juhas, G., Lorenz, R. Can I Execute my Scenario in your Net? VipTool tells you!. LNCS 4024, pages 380 - 389, 2006.
• Bergenthum, R. Algorithmen zur Verifikation von halbgeordneten Petrinetz-Abläufen: Implementierung und Anwendungen. Diplomarbeit, Katholische Universität Eichstätt-Ingolstadt, 2006.
• Juhas, G., Lorenz, R., Desel, J. Can I Execute my Scenario in your Net? LNCS 3536, pages 289 - 308, 2005.
• Desel, J., Juhas, G., Lorenz, R., Neumair, C. Modelling and Validation with VipTool. LNCS 2678, pages 380 - 389, 2003.