12. Workshop "Algorithmen und Werkzeuge für Petrinetze" (AWPN 2005)

We present the P-UMLaut tool, a versatile tool for animating and testing system behaviour. It provides a 3D visualization environment used to interactively explore possible system behaviour, and observe automatically simulated system evolution for testing purposes. The underlying simulation framework connects simulation engines with visualization frontends using translation maps in order to map event names, and network APIs to support a distributed application setup. As an example for the application of the tool the simulation is using Petri nets created from UML 2.0 sequences diagrams, but the tool is not limited to such kind of descriptions.

[1]  Kurt Lautenbach,et al.  A Completion of the S–invariance Technique by means of Fixed Point Algorithms , 2007 .

[2]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[3]  Tadao Kasami,et al.  Some Decision Problems Related to the Reachability Problem for Petri Nets , 1976, Theor. Comput. Sci..

[4]  Ian Horrocks,et al.  Applications of Description Logics: State of the Art and Research Challenges , 2005, ICCS.

[5]  Philippe Schnoebelen,et al.  Some Decidability Results for Nested Petri Nets , 1999, Ershov Memorial Conference.

[6]  Hartmann J. Genrich,et al.  Predicate/Transition Nets , 1986, Advances in Petri Nets.

[7]  Johan Lilius,et al.  prod 3.2: An Advanced Tool for Efficient Reachability Analysis , 1997, CAV.

[8]  Timothy Kam.  State minimization of finite state machines using implicit techniques , 1996 .

[9]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[10]  Manfred Fidelak.  Integritätsbedingungen in Petri-Netzen , 1993 .

[11]  Philippe Schnoebelen,et al.  Reset Nets Between Decidability and Undecidability , 1998, ICALP.

[12]  L. Thiele,et al.  Interval diagram techniques for symbolic model checking of Petri nets , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

[13]  Anne-Kathrin Lauer.  Literaturverzeichnis. , 1935, Die Nichtangriffsverpflichtung im deutschen und europäischen Kartellrecht.

[14]  Stephan Merz,et al.  Model Checking , 2000 .

[15]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[16]  Hartmann J. Genrich.  Predicate/transition nets , 1987 .

[17]  Bernd Grahlmann,et al.  The PEP Tool , 1997, CAV.

[18]  Lothar Thiele,et al.  Symbolic model checking using interval diagram techniques , 1998 .

[19]  Egon Börger,et al.  Abstract State Machines. A Method for High-Level System Design and Analysis , 2003 .

[20]  Wil M. P. van der Aalst,et al.  Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques , 2000, Business Process Management.

[21]  Gianfranco Ciardo,et al.  Efficient Reachability Set Generation and Storage Using Decision Diagrams , 1999, ICATPN.

[22]  Kishor S. Trivedi,et al.  A Decomposition Approach for Stochastic Reward Net Models , 1993, Perform. Evaluation.

[23]  Laure Petrucci,et al.  The Petri Net Markup Language: Concepts, Technology, and Tools , 2003, ICATPN.

[24]  Hanna Klaudel,et al.  M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages , 1998, Acta Informatica.

[25]  Wolfgang Reisig,et al.  An Operating Guideline Approach to the SOA , 2005 .

[26]  Kurt Lautenbach.  Linear Algebraic Techniques for Place/Transition Nets , 1986, Advances in Petri Nets.

[27]  Wolfgang Reisig,et al.  Petri Nets and Algebraic Specifications , 1991, Theor. Comput. Sci..

[28]  Juliane Dehnert.  A methodology for workflow modeling: from business process modeling towards sound workflow specification , 2003 .

[29]  Ian Horrocks,et al.  Practical Reasoning for Expressive Description Logics , 1999, LPAR.

[30]  Fausto Giunchiglia,et al.  Planning as Model Checking , 1999, ECP.

[31]  Carlo Simon,et al.  A logic of actions and its application to the development of programmable controllers , 2001 .

[32]  Luciano Lavagno,et al.  Quasi-static scheduling of independent tasks for reactive systems , 2002, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[33]  Wil M.P. van der Aalst,et al.  Pi calculus versus petri nets: let us eat humble pie rather than further inflate the Pi hype , 2005 .

[34]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[35]  Ekkart Kindler,et al.  On the semantics of EPCs: Efficient calculation and simulation , 2005, EPK.

[36]  Ekkart Kindler,et al.  3D-Visualization of Petri Net Models: Concept and Realization , 2004, ICATPN.

[37]  F. Vernadat,et al.  The tool TINA – Construction of abstract state spaces for petri nets and time petri nets , 2004 .

[38]  Uli Kutter,et al.  Literatur. , 1941, Subjekt.

[39]  José Meseguer,et al.  Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..

[40]  Boris Motik,et al.  Reducing SHIQ-Description Logic to Disjunctive Datalog Programs , 2004, KR.

[41]  A. Martens.  Verteilte Gesch?aftsprozesse-Modellierung und Verifikation mit Hilfe von Web Services , 2004 .

[42]  Thomas R. Gruber,et al.  A translation approach to portable ontology specifications , 1993, Knowl. Acquis..

[43]  Gottfried Vossen,et al.  Grundlagen der Transaktionsverarbeitung , 1993 .

[44]  Anca Muscholl,et al.  Bounded MSC communication , 2002, Inf. Comput..

[45]  Frank Leymann,et al.  Web services and business process management , 2002, IBM Syst. J..

[46]  Anca Muscholl,et al.  Message Sequence Charts , 2003, Lectures on Concurrency and Petri Nets.

[47]  Patrice Godefroid.  Using Partial Orders to Improve Automatic Verification Methods , 1990, CAV.

[48]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[49]  Roland Meyer,et al.  Compositional Semantics for UML 2.0 Sequence Diagrams Using Petri Nets , 2005, SDL Forum.

[50]  Ekkart Kindler,et al.  On the Semantics of EPCs: A Framework for Resolving the Vicious Circle , 2004, Business Process Management.

[51]  W.M.P. van der Aalst,et al.  Structural characterizations of sound workflow nets , 1996 .

[52]  August-Wilhelm Scheer,et al.  ARIS - Business Process Frameworks , 1998 .

[53]  Wolfgang Reisig.  On Gurevich's theorem on sequential algorithms , 2003, Acta Informatica.

[54]  Thomas Kropf,et al.  Symbolic model checking for a discrete clocked temporal logic with intervals , 1997, CHARME.

[55]  Monika Heiner,et al.  Model Validation of Biological Pathways Using Petri Nets - Demonstrated for Apoptosis , 2003, CMSB.

[56]  Karsten Schmidt,et al.  Operating Guidelines - an Alternative to Public View , 2005 .

[57]  Christian Stehno.  Interchangeable High-Level Time Petri Nets , 2005 .

[58]  Steffen Staab,et al.  Handbook on Ontologies (International Handbooks on Information Systems) , 2004 .

[59]  Ekkart Kindler,et al.  3 D-Visualization of Petri Net Models : A concept , 2003 .

[60]  Kurt Lautenbach,et al.  System Modelling with High-Level Petri Nets , 1981, Theor. Comput. Sci..

[61]  Philippe Schnoebelen,et al.  Boundedness of Reset P/T Nets , 1999, ICALP.

[62]  Boris Motik,et al.  Query Answering for OWL-DL with Rules , 2004, SEMWEB.

[63]  Marcos A. Castilho,et al.  Petriplan: A New Algorithm for Plan Generation (Preliminary Report) , 2000, IBERAMIA-SBIA.

[64]  Jordi Cortadella,et al.  Petri Net Analysis Using Boolean Manipulation , 1994, Application and Theory of Petri Nets.

[65]  Peter H. Starke,et al.  Analyse von Petri-Netz-Modellen , 1990, Leitfäden und Monographien der Informatik.

[66]  Hanno Ridder.  Analyse von Petri-Netz-Modellen mit Entscheidungsdiagrammen , 1997 .