Welcome to VipTool

- 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.

The viptool is developed at the catholic university of eichstaett in germany.

• VipTool, latest release (0.5.4) (Includes start scripts for Windows and Linux, and the solver library from http://lpsolve.sourceforge.net/ (32bit, Linux and Windows)). Requires at least Sun Java 1.6.

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

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.

• API
  • Online View
  • Zip file

2009-04-014

• Beta Version 0.5.3 uploaded
  • 'open with' added to context menu. A file can now be opened in more than one editor of different type.
  • file locking. Modified files are locked for all editors except the modifying one.
  • visual feedback of modified files and write-protected editors
  • test for external modification of files and reloading if wished
  • save on viptool close
  • the project tree restores his state on restart
  • filesystem improvements
  • lots of little bugfixes
  • workspace remembers open editors and layout of windows
  • project tree and log window doesn't get the focus anymore. This avoids tool- and menubar switching
  • tabtitle of focused window is now bold and all others are plain
  • tabs have a close button now
  • splash screen added

2009-03-20

• Version 0.5.1 released
  • new implementation of synthesis algorithms that are using the wrong continuation representation (now using the lp_solve library)
  • several bug fixes (creating files, saving files, extension loading, …)

2008-09-23

• Version 0.5 released
  • new algorithms for finding implicit places
  • extensions have now a version
  • unfolding algorithm with limit added

2008-09-04

• Version 0.4 released
  • composed lpos are now supported

2008-06-20

• Version 0.3 of Viptool released
  • A bugtracker is no available. It can be used to track bugs and as todo list. Information can be found under Bugtracker Help

• 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.

The namespace vipi:user contains documents that are relevant for all viptool users.

The namespace vipi:developer contains documents that are interesting for all (extension) developers of viptool.

Current content

• code-conventions

• viptoolextensions

If you want to see an overview of all pages currently available in Vipi, please click the 'Index' button on the bottom right of this page. This button is available on every page in the Vipi.

You can go always back to this page by clicking on the Vipi logo in the top right corner.

Before you add a new page be sure that a page with similar content does not already exisits!

You can use the search function tou search the Vipi.

To add a new page to the Vipi please go through the following steps:

1. Type the name of the page you want to add in the search box. You have to follow these rules vor Vipi page names:

• every page must lie in the namespace vipi. That means every page name have to start with vipi:

• belonging to the content of the page, the page has to be in the user or developer namespace. That means every page have to start with vipi:developer or vipi:user

• you can create more namespaces by using a colon between names. E.g. a:b:c will create the page c in b, that is nested in a

• If a page name should contain more words use a '-' for connecting the words, e.g. code-conventions

1. Click the 'Search' button

1. Click the 'Create Page' button at the bottom left of the page

1. After you have created the page, create a link on this page in the user or developer section

Please look on the syntax page for available syntax commands. The editor provides some buttons for basic formatting.

Two options that might be useful (and are not provided by buttons in the editor )

• You can create a block by beginning a line with to spaces

  example block

• You can create a java code block (with automatic syntax highlighting) by typing <code java> source code </code>

 
/**
 
 * main entry point of the application
 
 *
 
 */
 
public static void main(String[] args)
 
{
 
  // this method does nothing than return
 
  return;
 
}