Academia.eduAcademia.edu

Outline

Title
Abstract
Key Takeaways
Introduction and Motivation
Experimental Results
Discussion
Time-Related Abstractions
Conclusion and Future Works
Example: Request for Material Purchase
Conclusion and Perspectives
Case Study Setting
Case Study Results
Conclusion and Future Work
Introduction
Related Work
Conclusion
Summary
Future Work
Conclusions
Literature Review
Research Methodology
Data Collection
Conclusions and Future Work
References
All Topics
Computer Science

Application and Theory of Petri Nets and Concurrency

Profile image of L. PomelloL. Pomello

2013, Lecture Notes in Computer Science

https://doi.org/10.1007/978-3-642-38697-8
visibility

…

description

356 pages

link

1 file

Abstract

These are the proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE'13) in Milano, Italy, June 24-25, 2013. It is a co-located event of Petri Nets 2013, the 34th international conference on Applications and Theory of Petri Nets and Concurrency. More information about the workshop can be found at http://www.informatik.uni-hamburg.de/TGI/events/pnse13/ For the successful realisation of complex systems of interacting and reactive software and hardware components the use of a precise language at different stages of the development process is of crucial importance. Petri nets are becoming increasingly popular in this area, as they provide a uniform language supporting the tasks of modelling, validation, and verification. Their popularity is due to the fact that Petri nets capture fundamental aspects of causality, concurrency and choice in a natural and mathematically precise way without compromising readability. The use of Petri Nets (P/T-Nets, Coloured Petri Nets and extensions) in the formal process of software engineering, covering modelling, validation, and verification, will be presented as well as their application and tools supporting the disciplines mentioned above.

Key takeaways
sparkles

AI

  1. The paper explores the integration of Petri nets with service-oriented architectures for multi-agent systems.
  2. It introduces a WebGateway that facilitates interaction between Petri net-based applications and Web services.
  3. The authors demonstrate the effectiveness of their approach through a case study on distributed private key generation.
  4. The proposed toolset supports model-driven development, aiding in the design and analysis of real-time systems.
  5. The framework allows for efficient detection of language inclusion between sound unlabelled WF-nets, optimizing model checking.

Related papers

Modelling, prototyping, and verifying concurrent and distributed applications using object‐oriented Petri nets
Vladimír Janoušek

Kybernetes, 2002

This paper presents several research issues associated with the PNtalk language that is based on a certain kind of object‐oriented Petri nets (OOPNs) and intended mainly for modelling, prototyping, and verifying concurrent and distributed applications. The paper reviews the main concepts of PNtalk and OOPNs followed by a proposal of a system allowing prototypes based on PNtalk to be run in a distributed way. Furthermore, the first step made towards state spaces‐based formal analysis and verification over PNtalk OOPNs are also briefly mentioned in the paper.

View PDFchevron_right
Discovering Petri Nets A Personal Journey
Wil van der Aalst
View PDFchevron_right
Relational algebraic framework for the modelling and analysis of Petri nets
Kim Gon

Information and Software Technology, 1995

Petri nets are a powerful modelling tool for studying reactive, concurrent systems. While various means of analysis for the nets have been developed, a major limitation in the analysis is explosion of global states space in simulation. An efficient method to manage a large states space would overcome such a limitation. This paper proposes a framework for the modelling and analysis of Petri nets using relational database technologies. Within the framework, Petri nets and associated properties are formalized by relations defined in relational algebra. Analysis algorithms are developed based on such formal relations. Thus, our framework not only exploits all advantages of the database system in the management of complex data but also preserves formalism for the modelling and analysis of Petri nets. The framework has been realized in a commercial relational database system using a standard SQL. We demonstrate the feasibility of our methodology by the comparison of the implementation to an implementation in a memory-based environment.

View PDFchevron_right
Software Engineering and Petri Nets
Mauro Pezze'

2000

Object-oriented development of complex software systems is widely recognized as state of the art within the industry as well as the scientific community. What is less commonly recognized (especially in the industry) is that object-orientation itself is not properly defined and neither are popular notations like UML and others. Existing proposals for the formally based development of object-oriented systems are for different reasons often not usable for complex and/or concurrent systems. In addition, the semantics of object-oriented concepts within such notations only rarely match common programming language implementations. This mismatch most likely leads to a costly redesign of a given model during implementation. To overcome these problems approaches for a seamless object-oriented software development on a formal base are needed. This article surveys several proposals for the formally based development of object-oriented systems based on Petri-Nets. Subsequently, a new approach in this area is introduced which supports multiperspective modeling of concurrent object-oriented systems on arbitrary abstraction levels and also allows automatic generation of executable Java code.

View PDFchevron_right
Petri Nets for Component-Based Software Systems Development
Angelo Perkusich

Petri Net, Theory and Applications, 2008

View PDFchevron_right
Petri Net Approaches for Modelling and Validation
Fabrice Kordon

2001

View PDFchevron_right
A Straightforward Introduction to Formal Methods Using Coloured Petri Nets
Michel Soares

Proceedings of the 16th International Conference on Enterprise Information Systems, 2014

Coloured Petri Nets (CPN) arose from the need to model very large and complex systems, which are found in real industrial applications. The idea behind CPN is to unite the ability to represent synchronization and competition for resources of Petri nets with the expressive power of programming languages, data types and diverse abstraction levels. Through this union, systems which study was previously impractical have become amenable to study. The objective of this paper is to present a formal modeling of the Health Watcher System applying the concepts of CPN using CPN Tools. Using a graphical language such as CPN often proves to be a helpful didactic method for introducing formal methods. This paper presents a brief introduction to Coloured Petri Nets, and illustrates how the construction, simulation, and verification are supported through the use of CPN Tools.

View PDFchevron_right
Symbolic Execution of Concurrent Systems Using Petri Nets
Dino Mandrioli

Computer Languages, 1989

Techniques for analyzing sequential programs in order to improve their reliability have been widely studied in the past. Among the most interesting analysis techniques, we consider symbolic execution. However, analysis techniques for concurrent programs, and in particular symbolic execution, are still an open research area. In this paper, we define a method for symbolic execution of concurrent systems, based on an extension of the Petri net formalism, called EF nets. EF nets are a powerful, highly expressive and general formalism. Depending on the level of abstraction of actions and predicates that one associates to the transitions of the net, EF nets can be used as a high-level specification formalism for concurrent systems, or as a lower level internal representation of concurrent programs. Thus, the model is not dependent on a particular concurrent programming language, but it is flexible enough to be the kernel model for the representation of a wide set of systems and programming languages. In the paper, in order to support the analysis of a concurrent system or program, at first a general algorithm for symbolically executing an EF net is defined. Then, a more efficient algorithm is given for the particular, though important, subclass of EF nets, defined as sate EF nets. Such algorithm is proved to significantly help in reducing the amount of information needed to characterize a symbolic execution. Both the modelling power of the EF nets and the usefulness of the concurrent symbolic execution algorithms defined are illustrated by means of a case study.

View PDFchevron_right
Petri nets and programming: A survey
Panos Antsaklis

2009 American Control Conference, 2009

Petri nets and related models have been used for specification, analysis, and synthesis of programs. The paper contains a survey of several literature approaches and an examination of their relationship to Petri net modeling and supervisory control. The discussion is restricted to Petri net models in the class of place/transitions nets and the supervisory control of this class of models. II. PRELIMINARIES Given a PN, let µ denote the marking, q the firing vector, and v the Parikh vector. The firing vector represents the transition (or transitions) fired at a firing instance. The

View PDFchevron_right
Verification in concurrent programming with Petri nets structural techniques
Kamel Barkaoui

Proceedings Third IEEE International High-Assurance Systems Engineering Symposium (Cat. No.98EX231), 1998

This paper deals with verification of flow control in concurrent programs. We use Ada language model as reference. After translation of Ada programs into Petri nets (named Ada nets for Ada programs), we show how one can fully exploit the relationship between the behavior of the concurrent program and the structure of the corresponding Petri net. Using the siphon structure, we precise some structural conditions for behavioral properties such as deadlock-freeness and liveness that correct concurrent programs must satisfy. These conditions can be proved or disproved using efficient algorithms. We provide also a formal justification of guidelines (such as client/server paradigm) that programmers observe traditionally in order to built correct concurrent programs. Several examples are presented to show the effectiveness of using structure theory of Petri nets for static analysis of concurrent programs.

View PDFchevron_right

References (339)

  1. Weyns, D., Omicini, A., Odell, J.J.: Environment as a first-class abstraction in multi-agent systems. Autonomous Agents and Multi-Agent Systems 14(1) (Feb- ruary 2007) 5-30 Special Issue on Environments for Multi-agent Systems.
  2. Omicini, A., Ricci, A., Viroli, M.: Artifacts in the A&A meta-model for multi- agent systems. Autonomous Agents and Multi-Agent Systems 17(3) (December 2008) 432-456 Special Issue on Foundations, Advanced Topics and Industrial Per- spectives of Multi-Agent Systems.
  3. Ricci, A., Viroli, M., Omicini, A.: CArtAgO: A framework for prototyping artifact- based environments in MAS. In Weyns, D., Parunak, H.V.D., Michel, F., eds.: Environments for MultiAgent Systems III. Volume 4389 of LNAI. Springer (May 2007) 67-86 3rd International Workshop (E4MAS 2006), Hakodate, Japan, 8 May 2006. Selected Revised and Invited Papers.
  4. Omicini, A., Ricci, A., Viroli, M.: Agent Coordination Contexts for the formal spe- cification and enactment of coordination and security policies. Science of Computer Programming 63(1) (November 2006) 88-107 Special Issue on Security Issues in Coordination Models, Languages, and Systems.
  5. Mariani, S., Omicini, A.: Event-driven programming for situated MAS with Re- SpecT tuple centres. In: Workshop on Agent Based Computing: From Model to Implementation X (ABC:MI 2013), Koblenz, Germany (September 2013) Proceed- ings.
  6. Mariani, S., Omicini, A.: Molecules of Knowledge: Self-organisation in knowledge- intensive environments. In Fortino, G., Bȃdicȃ, C., Malgeri, M., Unland, R., eds.: Intelligent Distributed Computing VI. Volume 446 of Studies in Computational Intelligence., Springer (2013) 17-22 6th International Symposium on Intelligent Distributed Computing (IDC 2012), Calabria, Italy, 24-26 September 2012. Pro- ceedings.
  7. Zambonelli, F., Castelli, G., Ferrari, L., Mamei, M., Rosi, A., Di Marzo Seru- gendo, G., Risoldi, M., Tchao, A.E., Dobson, S., Stevenson, G., Ye, Y., Nardini, E., Omicini, A., Montagna, S., Viroli, M., Ferscha, A., Maschek, S., Wally, B.: Self-aware pervasive service ecosystems. Procedia Computer Science 7 (December 2011) 197-199 Proceedings of the 2nd European Future Technologies Conference and Exhibition 2011 (FET 11).
  8. TuCSoN: Home page. http://tucson.apice.unibo.it References
  9. S. Balaguer, T. Chatain, and S. Haar. Building tight occurrence nets from reveals relations. In Proceedings of the 11th International Conference on Application of Concurrency to System Design, pages 44-53. IEEE Computer Society Press, 2011.
  10. S. Balaguer, T. Chatain, and S. Haar. Building occurrence nets from reveals rela- tions. Fundamenta Informaticae, 123(3):245-272, 2013.
  11. G. Berthelot. Checking properties of nets using transformation. In Applications and Theory in Petri Nets, volume 222 of LNCS, pages 19-40. Springer, 1985.
  12. E. Best and B. Randell. A formal model of atomicity in asynchronous systems. Acta Informatica, 16(1):93-124, 1981.
  13. J. Desel and A. Merceron. Vicinity respecting homomorphisms for abstracting system requirements. In Proc. Int. Workshop on Abstractions for Petri Nets and Other Models of Concurrency (APNOC), 2009.
  14. S. Haar. Types of asynchronous diagnosability and the reveals-relation in occur- rence nets. IEEE Transactions on Automatic Control, 55(10):2310-2320, 2010.
  15. S. Haar, C. Kern, and S. Schwoon. Computing the reveals relation in occurrence nets. In Proceedings of GandALF'11, volume 54 of Electronic Proceedings in The- oretical Computer Science, pages 31-44, 2011.
  16. R. Kumar and S. Takai. Decentralized prognosis of failures in discrete event sys- tems. IEEE Transactions on Automatic Control, 55(1):48-59, 2010.
  17. A. Madalinski and V. Khomenko. Diagnosability verification with parallel LTL- X model checking based on Petri net unfoldings. In Control and Fault-Tolerant Systems (SysTol'2010), pages 398-403. IEEE Computing Society Press, 2010.
  18. A. Madalinski and V. Khomenko. Predictability verification with parallel LTL-X model checking based on Petri net unfoldings. In Proc. of the 8th IFAC Sympo- sium on fault detection, diagnosis and safety of technical processes (SAFEPRO- CESS'2012), pages 1232-1237, 2012.
  19. M. Nielsen, G. D. Plotkin, and G. Winskel. Petri nets, event structures and do- mains, part I. Theoretical Computer Science, 13:85-108, 1981.
  20. W. Zielonka. Notes on finite asynchronous automata. RAIRO, Theoretical Infor- matics and Applications, 21:99-135, 1987.
  21. D. J. Abadi, D. Carney, U. Çetintemel, M. Cherniack, C. Convey, S. Lee, M. Stone- braker, N. Tatbul, and S. Zdonik. Aurora: a new model and architecture for data stream management. The VLDB Journal, 12(2):120-139, 2003.
  22. A. Aiken, J. Widom, and J. M. Hellerstein. Behavior of database production rules: termination, confluence, and observable determinism. Proc. ACM SIGMOD, pp. 59-68. ACM Press, 1992.
  23. J. C. Augusto and C. D. Nugent. A new architecture for smart homes based on ADB and temporal reasoning. Toward a Human-Friendly Assistive Environment, vol. 14, pp. 106-113, 2004.
  24. E. Baralis, S. Ceri, and S. Paraboschi. Improved rule analysis by means of triggering and activation graphs. Rules in Database Systems, LNCS 985, pp. 163-181. 1995.
  25. E. Baralis and J. Widom. An algebraic approach to static analysis of active database rules. ACM TODS, 25(3):269-332, Sept. 2000.
  26. E.-H. Choi, T. Tsuchiya, and T. Kikuno. Model checking active database rules under various rule processing strategies. IPSJ Digital Courier, 2:826-839, 2006.
  27. G. Ciardo, R. L. Jones, A. S. Miner, and R. Siminiceanu. Logical and stochas- tic modeling with SMART. Proc. Modelling Techniques and Tools for Computer Performance Evaluation, LNCS 2794, pp. 78-97. 2003.
  28. S. Comai and L. Tanca. Termination and confluence by rule prioritization. IEEE TKDE, 15:257-270, 2003.
  29. K. G. Kulkarni, N. M. Mattos, and R. Cochrane. Active database features in SQL3. Active Rules in Database Systems, pp. 197-219. Springer, New York, 1999.
  30. E. A. Lee. Computing foundations and practice for cyber-physical systems: A pre- liminary report. Technical Report UCB/EECS-2007-72, UC Berkeley, May 2007.
  31. X. Li, J. M. Marín, and S. V. Chapa. A structural model of ECA rules in active database. Proc. Second Mexican International Conference on Artificial Intelli- gence: Advances in Artificial Intelligence, pp. 486-493. Springer, 2002.
  32. D. McCarthy and U. Dayal. The architecture of an active database management system. ACM SIGMOD Record, 18(2):215-224, 1989.
  33. T. Murata. Petri nets: properties, analysis and applications. Proc. of the IEEE, 77(4):541-579, Apr. 1989.
  34. D. Nazareth. Investigating the applicability of Petri nets for rule-based system verification. IEEE TKDE, 5(3):402-415, 1993.
  35. I. Ray and I. Ray. Detecting termination of active database rules using symbolic model checking. Proc. East European Conference on Advances in Databases and Information Systems, pp. 266-279. Springer, 2001.
  36. R. Valk. Generalizations of Petri nets. Mathematical foundations of computer science, LNCS 118, pp. 140-155. 1981.
  37. D. Varró. A formal semantics of UML statecharts by model transition systems. Proc. Int. Conf. on Graph Transformation, pp. 378-392. Springer, 2002.
  38. Y. Zhao and G. Ciardo. Symbolic CTL model checking of asynchronous systems using constrained saturation. Proc. ATVA, LNCS 5799, pp. 368-381. 2009.
  39. Y. Zhao and G. Ciardo. Symbolic computation of strongly connected components and fair cycles using saturation. ISSE, 7(2):141-150, 2011.
  40. Y. Zhao, J. Xiaoqing, and G. Ciardo. A symbolic algorithm for shortest EG witness generation. Proc. TASE, pp. 68-75. IEEE Comp. Soc. Press, 2011.
  41. W.M.P. van der Aalst. The Application of Petri Nets to Workflow Management. The Journal of Circuits, Systems and Computers, 8(1):21-66, 1998.
  42. W.M.P. van der Aalst, K.M. van Hee. Workflow Management: Models, Methods and Systems, MIT Press, 2002.
  43. W.M.P. van der Aalst, K.M. van Hee, A.H.M. Hofstede, N. Sidorova, H.M.W. Verbeek, M. Voorhoeve, M.T. Wynn. Soundness of workflow nets: classification, decidability, and analysis, Formal Aspects of Computing, 23(3):333-363, Springer, 2011.
  44. P. A. Abdulla, K. Čerans. Simulation is decidable for one-counter nets. In Proc. CONCUR'98, vol. 1466 of Lecture Notes in Computer Science, pages 253-268, Springer, 1998.
  45. K. Barkaoui, L. Petrucci. Structural Analysis of Workflow Nets with Shared Re- sources. In Proc. Workflow Management: Net-based Concepts, Models, Techniques and Tools (WFM98), volume 98/7 of Computing Science Reports, pages 82-95, Eidhoven University of Technology, 1998.
  46. K. Barkaoui, R. Ben Ayed, Z. Sbaï. Workflow Soundness Verification based on Structure Theory of Petri Nets. International Journal of Computing and Informa- tion Sciences, Vol. 5, No. 1, 2007. P.51-61.
  47. V. A. Bashkin, I. A. Lomazova. Petri Nets and resource bisimulation. Fundamenta Informaticae, Vol. 55, No. 2, 2003. P.101-114,
  48. V. A. Bashkin, I. A. Lomazova. Resource equivalence in workflow nets. In Proc. Concurrency, Specification and Programming, 2006, volume 1, pages 80-91. Berlin, Humboldt Universitat zu Berlin, 2006.
  49. K. van Hee, N. Sidorova, M. Voorhoeve. Generalized Soundness of Workflow Nets is Decidable. In Proc. ICATPN 2004, volume 3099 of Lecture Notes in Computer Science, pages 197-216. Springer, 2004.
  50. K. van Hee, A. Serebrenik, N. Sidorova, M. Voorhoeve. Soundness of Resource- Constrained Workflow Nets. In Proc. ICATPN 2005, volume 3536 of Lecture Notes in Computer Science, pages 250-267. Springer, 2005.
  51. K. van Hee, O. Oanea, A. Serebrenik, N. Sidorova, M. Voorhoeve, I.A. Lomazova. Checking Properties of Adaptive Workflow Nets. Fundamenta Informaticae, Vol. 79, No. 3, 2007. P.347-362.
  52. J. Hopcroft, J.-J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8(2), 1979, pages 135-159.
  53. N. Sidorova, C. Stahl. Soundness for Resource-Contrained Workflow Nets is De- cidable. In BPM Center Report BPM-12-09, BPMcenter.org, 2012.
  54. F. L. Tiplea, D. C. Marinescu. Structural soundness of workflow nets is decidable. Information Processing Letters, Vol. 96, pages 54-58. Elsevier, 2005. References
  55. Luca Bernardinello, Elisabetta Mangioni, and Lucia Pomello. Composition of Ele- mentary Net Systems based on α-morphisms. In Michael Köhler-Bußmeier, editor, Joint Proc. of LAM'12, WooPS'12, and CompoNet'12, Hamburg, Germany, June 25-26, 2012, volume 853 of CEUR Workshop Proceedings, pages 87-102. CEUR- WS.org, 2012.
  56. Luca Bernardinello, Elisabetta Mangioni, and Lucia Pomello. Local state refine- ment and composition on elementary net systems: an approach based on mor- phisms. Transactions on Petri Nets and Other Models of Concurrency (ToPNoC), special issue based on the workshops of Petri nets 2012 (to appear), 2012.
  57. Luca Bernardinello, Elisabetta Mangioni, and Lucia Pomello. Local State Refine- ment on Elementary Net Systems: an Approach Based on Morphisms. In Lawrence Cabac, Michael Duvigneau, and Daniel Moldt, editors, Petri Nets and Software Engineering. International Workshop, PNSE'12, Hamburg, Germany, June 25-26, 2012. Proceedings, volume 851 of CEUR Workshop Proceedings, pages 138-152. CEUR-WS.org, 2012.
  58. Luca Bernardinello, Elena Monticelli, and Lucia Pomello. On preserving struc- tural and behavioural properties by composing net systems on interfaces. Fundam. Inform., 80(1-3):31-47, 2007.
  59. Dan Boneh and Matthew K. Franklin. Identity-based encryption from the weil pairing. SIAM J. Comput., 32:586-615, 2003.
  60. Aniket Kate and Ian Goldberg. Asynchronous distributed private-key generators for identity-based cryptography. IACR Cryptology ePrint Archive, 2009:355, 2009.
  61. Gorkem Kilinc, Igor Nai Fovino, Carlo Ferigato, and Ahmet Koltuksuz. A model of distributed key generation for industrial control systems. In 11th Workshop on Discrete Event Systems, volume 11, pages 356-363, Guadalajara, Mexico, 2012.
  62. Elisabetta Mangioni. Modularity for system modelling and analysis. PhD thesis, Università degli Studi di Milano-Bicocca, Dottorato di ricerca in Informatica, ciclo 24, 2013.
  63. Robin Milner. Communication and concurrency. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1989.
  64. Mogens Nielsen, Gordon D. Plotkin, and Glynn Winskel. Petri nets, event struc- tures and domains, part i. Theor. Comput. Sci., 13:85-108, 1981.
  65. Mogens Nielsen, Grzegorz Rozenberg, and P. S. Thiagarajan. Elementary transi- tion systems. Theor. Comput. Sci., 96(1):3-33, 1992.
  66. Lucia Pomello, Grzegorz Rozenberg, and Carla Simone. A survey of equivalence notions for net based systems. In Grzegorz Rozenberg, editor, Advances in Petri Nets: The DEMON Project, volume 609 of Lecture Notes in Computer Science, pages 410-472. Springer, 1992.
  67. Grzegorz Rozenberg and Joost Engelfriet. Elementary net systems. In Wolfgang Reisig and Grzegorz Rozenberg, editors, Petri Nets, volume 1491 of Lecture Notes in Computer Science, pages 12-121. Springer, 1996.
  68. A. Shamir. Identity-based cryptosystems and signature schemes. Advances in Cryptology: Proceedings of CRYPTO 84, Lecture Notes in Computer Science, 7:47- 53, 1984. References
  69. Gul Agha, Fiorella De Cindio, and Grzegorz Rozenberg, editors. Advances in Petri Nets: Concurrent Object-Oriented Programming and Petri Nets, volume 2001 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
  70. Saeed Aghaee and Cesare Pautasso. Mashup development with HTML5. In Pro- ceedings of the 3rd and 4th International Workshop on Web APIs and Services Mashups, Mashups '09/'10, pages 10:1-10:8, New York, NY, USA, 2010. ACM.
  71. Tobias Betz, Lawrence Cabac, and Matthias Güttler. Improving the development tool chain in the context of Petri net-based software development. In Michael Duvigneau, Daniel Moldt, and Kunihiko Hiraishi, editors, Petri Nets and Software Engineering. International Workshop PNSE'11, Newcastle upon Tyne, UK, June 2011. Proceedings, volume 723 of CEUR Workshop Proceedings, pages 167-178. CEUR-WS.org, June 2011.
  72. Tobias Betz, Lawrence Cabac, and Matthias Wester-Ebbinghaus. Gateway archi- tecture for Web-based agent services. In Franziska Klügl and Sascha Ossowski, editors, Multiagent System Technologies, volume 6973 of Lecture Notes in Com- puter Science, pages 165-172. Springer Berlin / Heidelberg, 2011.
  73. Lawrence Cabac. Modeling Petri Net-Based Multi-Agent Applications, volume 5 of Agent Technology -Theory and Applications. Logos Verlag, Berlin, 2010.
  74. Lawrence Cabac, Till Dörges, Michael Duvigneau, Daniel Moldt, Christine Reese, and Matthias Wester-Ebbinghaus. Agent models for concurrent software systems. In Ralph Bergmann and Gabriela Lindemann, editors, Proceedings of the Sixth German Conference on Multiagent System Technologies, MATES'08, volume 5244 of Lecture Notes in Artificial Intelligence, pages 37-48, Berlin Heidelberg New York, 2008. Springer-Verlag.
  75. Lawrence Cabac, Michael Duvigneau, Daniel Moldt, and Heiko Rölke. Modeling dynamic architectures using nets-within-nets. In Gianfranco Ciardo and Philippe Darondeau, editors, Applications and Theory of Petri Nets 2005. 26th International Conference, ICATPN 2005, Miami, USA, June 2005. Proceedings, volume 3536 of Lecture Notes in Computer Science, pages 148-167, 2005.
  76. Lawrence Cabac, Michael Duvigneau, Daniel Moldt, and Matthias Wester- Ebbinghaus. Towards unit testing for Java reference nets. In Robin Bergenthum and Jörg Desel, editors, Algorithmen und Werkzeuge für Petrinetze. 18. Workshop AWPN 2011, Hagen, September 2011. Tagungsband, pages 1-6, 2011.
  77. Lawrence Cabac, Daniel Moldt, and Heiko Rölke. A proposal for structuring Petri net-based agent interaction protocols. In Wil van der Aalst and Eike Best, editors, 24th International Conference on Application and Theory of Petri Nets, Eindhoven, Netherlands, June 2003, volume 2679 of Lecture Notes in Computer Science, pages 102-120. Springer-Verlag, June 2003.
  78. Lawrence Cabac and Jan Schlüter. ImageNetDiff: A visual aid to support the discovery of differences in Petri nets. In 15. Workshop Algorithmen und Werkzeuge für Petrinetze, AWPN'08, volume 380 of CEUR Workshop Proceedings, pages 93- 98. Universität Rostock, September 2008.
  79. Michael Duvigneau, Daniel Moldt, and Heiko Rölke. Concurrent architecture for a multi-agent platform. In Fausto Giunchiglia, James Odell, and Gerhard Weiß, editors, Agent-Oriented Software Engineering. 3rd International Workshop, AOSE 2002, Bologna. Proceedings, pages 147-159. ACM Press, July 2002.
  80. Roy T. Fielding and Richard N. Taylor. Principled design of the modern Web architecture. ACM Trans. Internet Technol., 2:115-150, May 2002.
  81. OASIS (Organization for the Advancement of Structured Information Stan- dards). BPEL: Web services business process execution language. Avail- able at: http://bpel.xml.org/, 2012. Release 2.0: http://docs.oasis- open.org/wsbpel/2.0/OS/wsbpel-v2.0-OS.html.
  82. D. Greenwood and M. Calisti. Engineering Web service -agent integration. In Systems, Man and Cybernetics, 2004 IEEE International Conference on, volume 2, pages 1918 -1925 vol.2, october 2004.
  83. Sebastian Hinz, Karsten Schmidt, and Christian Stahl. Transforming BPEL to Petri nets. Lecture Notes in Computer Science, 3649:220-235, 2005.
  84. Ekkart Kindler, Vladimir Rubin, and Robert Wagner. Component tools: Integrat- ing Petri nets with other formal methods. Lecture Notes in Computer Science : Petri Nets and Other Models of Concurrency -ICATPN 2006, Volume 4024, 2006, pages 37-56, 2006.
  85. Michael Köhler, Daniel Moldt, and Heiko Rölke. Modelling the structure and behaviour of Petri net agents. In J.M. Colom and M. Koutny, editors, Proceedings of the 22nd Conference on Application and Theory of Petri Nets 2001, volume 2075 of Lecture Notes in Computer Science, pages 224-241. Springer-Verlag, 2001.
  86. Olaf Kummer, Frank Wienberg, Michael Duvigneau, Jörn Schumacher, Michael Köhler, Daniel Moldt, Heiko Rölke, and Rüdiger Valk. An extensible editor and simulation engine for Petri nets: Renew. In Jordi Cortadella and Wolfgang Reisig, editors, Applications and Theory of Petri Nets 2004. 25th International Confer- ence, ICATPN 2004, Bologna, Italy, June 2004. Proceedings, volume 3099 of Lec- ture Notes in Computer Science, pages 484-493, Berlin Heidelberg New York, June 2004. Springer.
  87. Esteban León Soto. Agent communication using Web services, a new fipa mes- sage transport service for jade. In Paolo Petta, Jörg Müller, Matthias Klusch, and Michael Georgeff, editors, Multiagent System Technologies, volume 4687 of Lec- ture Notes in Computer Science, pages 73-84. Springer Berlin / Heidelberg, 2007. 10.1007/978-3-540-74949-3_7.
  88. T. Miyamoto and S. Kumagai. An agent net approach to autonomous distributed systems. In Proc. of 1996 IEEE Systems, Man, and Cybernetics, 14-17 October 1996, Beijing, China, pages 3204-3209, October 1996.
  89. Daniel Moldt, Sven Offermann, and Jan Ortmann. A Petri net-based architecture for web services. In Lawrence Cavedon, Ryszard Kowalczyk, Zakaria Maamar, David Martin, and Ingo Müller, editors, Workshop on Service-Oriented Computing and Agent-Based Engineering, SOCABE 2005, Utrecht, Netherland, July 26, 2005. Proceedings, pages 33-40, 2005.
  90. Julia Padberg and Hartmut Ehrig. Petri net modules in the transformation-based component framework. Journal of Logic and Algebraic Programming, Vol 97 (1-2), pages 198-225, 2006.
  91. Cesare Pautasso, Olaf Zimmermann, and Frank Leymann. Restful web services vs. "big" web services: making the right architectural decision. In Proceeding of the 17th international conference on World Wide Web, WWW '08, pages 805-814, New York, NY, USA, 2008. ACM.
  92. M. Omair Shafiq, Ying Ding, and Dieter Fensel. Bridging multi agent systems and Web services: towards interoperability between software agents and semantic Web services. In Enterprise Distributed Object Computing Conference, 2006. EDOC '06. 10th IEEE International, pages 85 -96, october 2006.
  93. Rüdiger Valk. Object Petri Nets -Using the Nets-within-Nets Paradigm. In Jörg Desel, Wolfgang Reisig, and Grzegorz Rozenberg, editors, Advances in Petri Nets: Lectures on Concurrency and Petri Nets, volume 3098 of Lecture Notes in Computer Science, pages 819-848. Springer-Verlag, Berlin Heidelberg New York, 2004.
  94. World Wide Web Consortium (W3C). The websocket api editor's draft 6. Website, June 2011. http://dev.w3.org/html5/websockets.
  95. Karsten Wolf. Does my service have partners? LNCS ToPNoC, 5460(II):152-171, March 2009. Special Issue on Concurrency in Process-Aware Information Systems. References
  96. Fiamberti, F., Micucci, D., Tisato, F.: An architecture for time-aware systems. In: 2011 IEEE 16th Conference on Emerging Technologies & Factory Automation (ETFA), IEEE (2011)
  97. Buckl, C., Gaponova, I., Geisinger, M., Knoll, A., Lee, E.A.: Model-based speci- fication of timing requirements. In: Proceedings of the tenth ACM international conference on Embedded software. EMSOFT '10, ACM (2010) 239-248
  98. Zhao, Y., Liu, J., Lee, E.A.: A programming model for Time-Synchronized dis- tributed Real-Time systems. In: 13th IEEE Real Time and Embedded Technology and Applications Symposium, 2007. RTAS '07, IEEE (2007) 259-268
  99. OMG: MARTE Modeling and Analysis of Real-Time and Embedded systems. http://www.omg.org/spec/MARTE/1.1/PDF/
  100. OMG: Unified Modeling Language (UML), Superstructure. http://www.omg.org/spec/UML/2.4.1/Superstructure/PDF/
  101. Peraldi-Frati, M., DeAntoni, J.: Scheduling multi clock real time systems: From requirements to implementation. In: Object/Component/Service-Oriented Real- Time Distributed Computing (ISORC), 2011 14th IEEE International Symposium on. (2011) 50 -57
  102. Mallet, F.: Clock constraint specification language: specifying clock constraints with UML/MARTE. Innovations in Systems and Software Engineering 4(3) (2008) 309-314
  103. Henzinger, T., Horowitz, B., Kirsch, C.: Giotto: a time-triggered language for embedded programming. Proceedings of the IEEE 91(1) (2003) 84-99
  104. Gamatié, A., Gautier, T., Guernic, P.L., Talpin, J.P.: Polychronous design of embedded real-time applications. ACM Trans. Softw. Eng. Methodol. 16(2) (2007)
  105. Shaw, M., DeLine, R., Klein, D.V., Ross, T.L., Young, D.M., Zelesnik, G.: Ab- stractions for software architecture and tools to support them. IEEE Transactions on Software Engineering 21(4) (1995) 314-335
  106. Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77(4) (1989) 541-580
  107. Starke, P.H.: Analyse von Petri-netz-modellen. Teubner BG GmbH (1990) 13. Starke, P.H.: INA Integrated Net Analyzer. http://www2.informatik.hu- berlin.de/lehrstuehle/automaten/ina/manual.html
  108. Fiamberti, F., Micucci, D., Tisato, F.: An object-oriented application framework for the development of real-time systems. In: 50th International Conference on Objects, Models, Components, Patterns (TOOLS 2012), Springer (2012) 75-90
  109. Bernini, D., Fiamberti, F., Micucci, D., Tisato, F.: Architectural Abstractions for Spaces-Based Communication in Smart Environments. Journal of Ambient Intelligence and Smart Environments 4(3) (2012)
  110. Fiamberti, F., Micucci, D., Mobilio, M., Tisato, F.: A Layered Architecture based on Previsional Mechanisms. In: ICSOFT 2013 -Proceedings of the 8th Interna- tional Joint Conference on Software Technologies (accepted for publication). (2013) References
  111. Weidlich, M., Werf, J.M.E.M.v.d.: On Profiles and Footprints -Relational Seman- tics for Petri Nets. [22] 148-167
  112. Glabbeek, R.J.v., Weijland, W.P.: Branching Time and Abstraction in Bisimula- tion Semantics. Journal of the ACM (JACM) (1996)
  113. Kunze, M., Weidlich, M., Weske, M.: Behavioral Similarity -A Proper Metric. In Rinderle-Ma, S., Toumani, F., Wolf, K., eds.: BPM. Volume 6896 of Lecture Notes in Computer Science., Springer (2011) 166-181
  114. Aalst, W.M.P.v.d., Adriansyah, A., Dongen, B.F.v.: Causal Nets: A Modeling Language Tailored towards Process Discovery. In Katoen, J.P., König, B., eds.: CONCUR. Volume 6901 of Lecture Notes in Computer Science., Springer (2011) 28-42
  115. Schunselaar, D.M.M., Verbeek, H.M.W., Aalst, W.M.P.v.d., Reijers, H.A.: Cre- ating Sound and Reversible Configurable Process Models Using CoSeNets. In Abramowicz, W., Kriksciuniene, D., Sakalauskas, V., eds.: BIS. Volume 117 of Lecture Notes in Business Information Processing., Springer (2012) 24-35
  116. Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press (1999)
  117. Abdulla, P.A., Chen, Y.F., Holík, L., Mayr, R., Vojnar, T.: When simulation meets antichains. In Esparza, J., Majumdar, R., eds.: TACAS. Volume 6015 of Lecture Notes in Computer Science., Springer (2010) 158-174
  118. Dill, D.L., Hu, A.J., Wong-Toi, H.: Checking for language inclusion using simula- tion preorders. In Larsen, K.G., Skou, A., eds.: CAV. Volume 575 of Lecture Notes in Computer Science., Springer (1991) 255-265
  119. Aalst, W.M.P.v.d., Weijters, A.J.M.M., Maruster, L.: Workflow Mining: Discover- ing Process Models from Event Logs. IEEE Transactions on Knowledge and Data Engineering 16(9) (2004) 1128-1142
  120. Badouel, E.: On the α-reconstructibility of workflow nets. [22] 128-147
  121. Wen, L., van der Aalst, W.M.P., Wang, J., Sun, J.: Mining process models with non-free-choice constructs. Data Mining and Knowledge Discovery 15(2) (2007) 145-180
  122. Weidlich, M., Polyvyanyy, A., Mendling, J., Weske, M.: Causal Behavioural Profiles -Efficient Computation, Applications, and Evaluation. Fundamenta Informaticae 113(3-4) (2011) 399-435
  123. Weidlich, M., Polyvyanyy, A., Desai, N., Mendling, J., Weske, M.: Process com- pliance analysis based on behavioural profiles. Information Systems 36(7) (2011) 1009-1025
  124. Smirnov, S., Weidlich, M., Mendling, J.: Business process model abstraction based on behavioral profiles. In Maglio, P.P., Weske, M., Yang, J., Fantinato, M., eds.: ICSOC. Volume 6470 of Lecture Notes in Computer Science. (2010) 1-16
  125. Dongen, B.F.v., Mendling, J., Aalst, W.M.P.v.d.: Structural Patterns for Sound- ness of Business Process Models. In: EDOC, IEEE Computer Society (2006) 116- 128
  126. Mendling, J., van Dongen, B.F., van der Aalst, W.M.P.: On the degree of behav- ioral similarity between business process models. In Nüttgens, M., Rump, F.J., Gadatsch, A., eds.: EPK. Volume 303 of CEUR Workshop Proceedings., CEUR- WS.org (2007) 39-58
  127. Solé, M., Carmona, J.: A High-Level Strategy for C-net Discovery. In Brandt, J., Heljanko, K., eds.: ACSD, IEEE Computer Society (2012) 102-111
  128. Desel, J.: Validation of process models by construction of process nets. In Aalst, W.M.P.v.d., Desel, J., Oberweis, A., eds.: BPM. Volume 1806 of Lecture Notes in Computer Science., Springer (2000) 110-128
  129. Lautenbach, K.: Liveness in Petri Nets. Internal Report of the Gesellschaft für Mathematik und Datenverarbeitung. Bonn, Germany, ISF/75-02-1 (1975)
  130. Desel, J., Esparza, J.: Free Choice Petri Nets (Cambridge Tracts in Theoretical Computer Science). Cambridge University Press (1995)
  131. Aalst, W.M.P.v.d.: Verification of Workflow Nets. In Azéma, P., Balbo, G., eds.: ICATPN. Volume 1248 of Lecture Notes in Computer Science., Springer (1997) 407-426
  132. Haddad, S., Pomello, L., eds.: Application and Theory of Petri Nets -33rd Inter- national Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012. Proceedings. In Haddad, S., Pomello, L., eds.: Petri Nets. Volume 7347 of Lecture Notes in Computer Science., Springer (2012) References
  133. Michael James Adams. Facilitating dynamic flexibility and exception handling for workflows. PhD thesis, Queensland University of Technology, 2007.
  134. Søren Christensen and Niels Damgaard Hansen. Coloured petri nets extended with place capacities, test arcs and inhibitor arcs. In Marco Ajmone Marsan, editor, Application and Theory of Petri Nets, volume 691 of Lecture Notes in Computer Science, pages 186-205. Springer, 1993.
  135. W.L.A. de Oliveira, N. Marranghello, and F. Damiani. Exception handling with petri net for digital systems. In Integrated Circuits and Systems Design, 2002. Proceedings. 15th Symposium on, pages 229-234, 2002.
  136. M. Doligalski and M. Adamski. Exceptions handling in hierarchical petri net based specification for logic controllers. In Systems Engineering (ICSEng), 2011 21st International Conference on, pages 459-460, 2011.
  137. Dietmar Jannach and Alexander Gut. Exception handling in web service processes. In Roland Kaschek and Lois M. L. Delcambre, editors, The Evolution of Concep- tual Modeling, volume 6520 of Lecture Notes in Computer Science, pages 225-253.
  138. Olaf Kummer. Referenznetze. Logos Verlag, Berlin, 2002.
  139. Olaf Kummer, Frank Wienberg, Michael Duvigneau, and Lawrence Cabac. Renew -the Reference Net Workshop. Available at: http://www.renew.de/, March 2012. Release 2.3.
  140. Wolfgang Reisig. Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets. Springer-Verlag New York, October 1997.
  141. UML. Unified modeling language: Superstructure. http://www.omg.org/spec/UML/ 2.4.1/Superstructure/PDF, August 2011.
  142. K. Kanoun, M. Borrel, Fault-tolerant system Dependability: Explicit model- ing of hardware and software component-interactions, IEEE Transactions on Reliability, 49, (2000).
  143. SAE-AS5506. Architecture Analysis and Design Language, SAE, (2004).
  144. SAE-AS5506/1, Architecture Analysis and Design Language Annex Volume 1. SAE, (2006).
  145. Ana Elena Rugina, Karama Kanoun, Mohamed Kaaniche, System Dependabil- ity modeling using AADL langage, 15eme Congres de Maitrise des Risques et de Surete de Fonctionnement, Lille, (2006).
  146. Ana-Elena Rugina, Dependability Modeling and Evaluation: From AADL to Stochastic Petri nets, PhD.D. thesis, Institut National Polytechnique de Toulouse, France, (2007).
  147. Thomas Vergnaud. Modelisation des Systemes Temps reel Repartis Embarques pour la Generation Automatique d Application Formellement Verifiees. PhD thesis, Ecole Nationale Superieure des Telecommunications, (2006).
  148. P. Feiler, B. Lewis, and S. Vestal. The SAE Architecture Analysis & Design Language (AADL) A Standard for Engineering Performance Critical Systems. In Proceedings of the 2006 IEEE Conference on Computer Aided Control Sys- tems Design, (2006).
  149. Rogerio de Lemos, Cristina Gacek, Alexander B. Romanovsky, Architecting Dependable Systems IV, Lecture Notes in Computer Science 4615, Springer, (2007).
  150. Jean-Claude Laprie, Dependable Computing: Concepts, Limits, Challenges, Invited paper to FTCS-25, the 25th IEEE International Symposium on Fault- Tolerant Computing,Pasadena, California, USA, June 27-30, Special Issue, (1995).
  151. M. Borrel, Interactions entre composants materiel et logiciel de systemes tol- erant aux fautes -Caracterisation -Formalisation -Modelisation -Application a la surete de fonctionnement du CAUTRA, LAAS-CNRS, These de doctorat, Toulouse, France, (1996).
  152. A. Bondavalli, S. Chiaradonna, F. D. Giandomenico, J. Xu, Fault-tolerant system Dependability: Explicit modeling of hardware and software component- interactions, Journal of Systems Architecture, 49, (2002).
  153. B. Berthomieu, P.-O. Ribet, F. Vernadat, The tool TINA -Construction of Ab- stract State Spaces for Petri Nets and Time Petri Nets, International Journal of Production Research, Vol. 42, No 14,(2004).
  154. Kais Ben Fadhel, une approche de modelisation et d'analyse des performances et de la surete de fonctionnement : Transformation d'une specification AADL en GSPN, Master de recherche, faculte des sciences de Monastir, Tunisie, (2012). References
  155. CPN Tools Homepage. http://cpntools.org/.
  156. PNML reference site. http://pnml.org/.
  157. C. Choppy, L. Petrucci, and G. Reggio. Designing coloured Petri net models: a method. In Proc. Workshop on Practical Use of Coloured Petri Nets, 2007.
  158. CosyVerif group, The. CosyVerif home page. http://cosyverif.org.
  159. Charles Lakos. On the abstraction of coloured Petri nets. In 18th Int. Conference on Application and Theory of Petri Nets ICATPN '97, volume 1248 of Lecture Notes in Computer Science, pages 42-61. Springer-Verlag, 1997.
  160. Charles Lakos. Composing abstractions of coloured Petri nets. In Nielsen, M. and Simpson, D., editors, 21st Int. Conf. on Application and Theory of Petri Nets (ICATPN), volume 1825 of Lecture Notes in Computer Science, pages 323-345.
  161. Charles Lakos and Glenn Lewis. A catalogue of incremental changes for coloured Petri nets. Technical report, Department of Computer Science, University of Ade- laide, 1999.
  162. Glenn Lewis. Incremental specification and analysis in the context of coloured Petri nets. PhD thesis, University of Hobart, Tasmania, 2002.
  163. Barbara Liskov and Jeannette M. Wing. Family values: A semantic notion of subtyping. Technical report, Pittsburgh, PA, USA, 1992.
  164. Barbara Liskov and Jeannette M. Wing. A new definition of the subtype relation. In Proceedings of the 7th European Conference on Object-Oriented Programming, ECOOP '93, pages 118-141, London, UK, 1993. Springer-Verlag.
  165. Barbara H. Liskov and Jeannette M. Wing. A behavioral notion of subtyping. ACM Trans. on Programming Languages and Systems, 16(6):1811-1841, 1994.
  166. Alfred Sanogo. Raffinement des réseaux de Petri colorés. PhD thesis, Université Paris 13, 2012.
  167. Van der Aalst, W.M.P., Van Hee, K.M. 2002. Workflow Management: Models, Meth- ods, and Systems. IT press, Cambridge, MA.
  168. Van der Aalst, W.M.P., Ter Hofstede, A.H.M. 2005. YAWL: yet another workflow language. Inf. Syst. 30, 4 (June 2005), 245-275.
  169. Valk, R. 1998. Petri Nets as Token Objects: An Introduction to Elementary Ob- ject Nets. In Proceedings of the 19th International Conference on Application and Theory of Petri Nets (ICATPN '98), Jrgen Desel and Manuel Silva (Eds.). Springer- Verlag, London, UK, 1-25.
  170. Kummer, O. 2001. Introduction to petri nets and reference nets. SozionikAktuell 1:2001 / Rolf von Lüde, Daniel Moldt, Rüdiger Valk (Hrsg.).
  171. Cabac, L., Duvigneau, M., Moldt, D., Rölke, H. 2005. Modeling dynamic architec- tures using nets-within-nets. In Proceedings of the 26th international conference on Applications and Theory of Petri Nets (ICATPN'05), Gianfranco Ciardo and Philippe Darondeau (Eds.). Springer-Verlag, Berlin, Heidelberg, 148-167.
  172. Kummer, O., Wienberg, F., Duvigneau, M., Köhler, M., Moldt, D., and Rölke, H. 2003. Renew -the Reference Net Workshop. Tool Demonstrations. Eric Veerbeek (ed.). 24th International Conference on Application and Theory of Petri Nets (ATPN 2003).
  173. Češka M., Janoušek V., Vojnar T. PNtalk -A Computerized Tool for Object Ori- ented Petri Nets Modelling. Lecture Notes in Computer Science, vol. 1333, DE, p. 591-610, ISBN 3-540-63811-3, ISSN 0302-9743, 1997.
  174. Richta, T., Janoušek, V. 2013. Operating System for Petri Nets-Specified Reconfig- urable Embedded Systems, To appear in: Proceedings of the 14th Computer Aided Systems Theory, Las Palmas de Grand Canaria, LNCS, Springer Verlag.
  175. Richta, T., Janoušek, V., Kočí, R. 2012. Code Generation For Petri Nets-Specified Reconfigurable Distributed Control Systems, In: Proceedings of 15th International Conference on Mechatronics -Mechatronika 2012, Praha, CZ, FEL Č, 2012, s. 263- 269, ISBN 978-80-01-04985-3.
  176. Pizlo, F., Ziarek, L., et al. 2010. High-level programming of embedded hard real- time devices. In Proceedings of the 5th European conference on Computer systems, ACM New York, 69-82.
  177. Fernandez, J.L., Sanz, R., Paz, E., Alonso, C. 2008. Using hierarchical binary Petri nets to build robust mobile robot applications: RoboGraph. In IEEE International Conference on Robotics and Automation. 1372-1377.
  178. Rust, C., Stappert, F., Kunnemeyer, R. From Timed Petri Nets to Interrupt-Driven Embedded Control Software. In International Conference on Computer, Communi- cation and Control Technologies (CCCT 2003), Orlando, Florida, USA. p. 6.
  179. Bayo-Puxan, O., Rafecas-Sabate, J., Gomis-Bellmunt, O., Bergas-Jane, J. 2008. A GRAFCET-compiler methodology for C-programmed microcontrollers, In Assembly Automation, Vol. 28 Iss: 1, Emerald Group Publishing. 55-60.
  180. W.M.P. van der Aalst. Process Mining: Discovery, Conformance and Enhancement of Business Processes. Springer-Verlag, 2011.
  181. W.M.P. van der Aalst. Decomposing Process Mining Problems Using Passages. In S. Haddad and L. Pomello, editors, Applications and Theory of Petri Nets 2012, volume 7347 of Lecture Notes in Computer Science, pages 72-91. Springer-Verlag, 2012.
  182. W.M.P. van der Aalst, B.F. van Dongen, C.W. Günther, R.S. Mans, A.K. Alves de Medeiros, A. Rozinat, V. Rubin, M. Song, H.M.W. Verbeek, and A.J.M.M. Weijters. ProM 4.0: Comprehensive Support for Real Process Analysis. In J. Kleijn and A. Yakovlev, editors, Application and Theory of Petri Nets and Other Models of Concurrency (ICATPN 2007), volume 4546 of Lecture Notes in Computer Science, pages 484-494. Springer-Verlag, 2007.
  183. A. Adriansyah, B. van Dongen, and W.M.P. van der Aalst. Conformance Checking using Cost-Based Fitness Analysis. In C.H. Chi and P. Johnson, editors, IEEE International Enterprise Computing Conference (EDOC 2011), pages 55-64. IEEE Computer Society, 2011.
  184. J. Carmona, J. Cortadella, and M. Kishinevsky. Divide-and-Conquer Strategies for Process Mining. In U. Dayal, J. Eder, J. Koehler, and H. Reijers, editors, Business Process Management (BPM 2009), volume 5701 of Lecture Notes in Computer Science, pages 327-343. Springer-Verlag, 2009.
  185. B. F. van Dongen. BPI challenge 2012. Dataset. http://dx.doi.org/10.4121/uuid:3926db30-f712-4394-aebc-75976070e91f, 2012.
  186. J. Munoz-Gama, J. Carmon, and W. M. P. van der Aalst. Hierarchical conformance checking of process models based on event logs. In ATPN 2013, LNCS. Springer, 2013. Accepted for publication.
  187. T. Murata. Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE, 77(4):541-580, April 1989.
  188. W. Reisig and G. Rozenberg, editors. Lectures on Petri Nets I: Basic Models, volume 1491 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
  189. A. Rozinat and W.M.P. van der Aalst. Conformance Checking of Processes Based on Monitoring Real Behavior. Information Systems, 33(1):64-95, 2008.
  190. W. M. P. van der Aalst. Decomposing Petri Nets for Process Mining: A Generic Approach. Technical Report BPM-12-20, BPMcenter.org, 2012.
  191. Wil van der Aalst, Arya Adriansyah, and Boudewijn van Dongen. Replaying history on process models for conformance checking and performance analysis. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 2(2):182-192, 2012.
  192. H. M. W. Verbeek. BPI Challenge 2012: The Transition System Case. In M. La Rosa and P. Soffer, editors, BPM 2012 Workshops, volume 132 of LNBIP, pages 225-226. Springer, 2013.
  193. H. M. W Verbeek and W. M. P. van der Aalst. Decomposing replay problems: A case study. Technical Report BPM-13-09, BPMcenter.org, 2013.
  194. Jensen, K., Kristensen, L.: Coloured Petri Nets: Modelling and Validation of Con- current Systems. Springer (2009)
  195. Fronc, L., Pommereau, F.: Optimizing the compilation of Petri nets models. In: Proc. of SUMo'11. Volume 726., CEUR (2011)
  196. Kordon, F., Fronc, L., Pommereau, F., et al.: Raw Report on the Model Checking Contest at Petri Nets 2012. Technical report (2012)
  197. Duret-Lutz, A.: LTL translation improvements in Spot. In: Proceedings of the 5th International Workshop on Verification and Evaluation of Computer and Commu- nication Systems (VECoS'11). Electronic Workshops in Computing, Tunis, Tunisia, British Computer Society (2011)
  198. Behnel, S., Bradshaw, R., Citro, C., Dalcin, L., Seljebotn, D., Smith, K.: Cython: The best of both worlds. Computing in Science Engineering 13 (2011) 31 -39
  199. Fronc, L.: Effective Marking Equivalence Checking in Systems with Dynamic Pro- cess Creation. In: Infinity'12. Electronic Proceedings in Theoretical Computer Science, Paris (2012)
  200. Pommereau, F.: Quickly prototyping Petri nets tools with SNAKES. Petri net newsletter (2008)
  201. Pommereau, F.: Algebras of coloured Petri nets. LAP LAMBERT Academic Publishing (2010)
  202. Hillah, L., Kindler, E., Kordon, F., Petrucci, L., Trèves, N.: A primer on the Petri Net Markup Language and ISO/IEC 15909-2. In: 10th International workshop on Practical Use of Colored Petri Nets and the CPN Tools (CPN'09). (2009)
  203. Fronc, L.: Neco net compiler wiki. goo.gl/CXrry (2012)
  204. Khomenko, V.: Model checking based on Petri net unfolding prefixes. PhD thesis, PhD thesis, School of Computer Science, University of Newcastle upon Tyne (2002)
  205. Tismer, C.: Continuations and stackless Python. In: Proceedings of the 8th Inter- national Python Conference. (2000)
  206. Dufour, M.: Shed skin. http://code.google.com/p/shedskin (2012)
  207. Hayen, K.: Nuitka. http://nuitka.net (2012)
  208. Bolz, C.F., Cuni, A., Fijalkowski, M., Rigo, A.: Tracing the meta-level: PyPy's tracing JIT compiler. In: Proc. ICOOOLPS '09, ACM (2009) References
  209. R. Alur, C. Courcoubetis, and D. Dill. Model checking in dense real-time. Information and Computation, 104(1):2-34, 1993.
  210. R. Alur and D. Dill. Automata for modelling real-time systems. In In Proc. Of ICALP'90, volume 443 of LNCS, pages 322-335. Springer-Verlag, 1990.
  211. G. Behrmann, J. Bengtsson, A. David, K. G. Larsen, P. Pettersson, and W. Yi. Uppaal im- plementation secrets. In In Proc. of FTRTFT-02, pages 3-22, 2002.
  212. B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time petri nets. IEEE Trans. on Software Eng, 17(3):259-273, 1991.
  213. B. Berthomieu and M. Menasche. An enumerative approach for analyzing time petri nets. In In Proc. of IFIP83, volume 9, pages 41-46, September 1983.
  214. B. Berthomieu, P.O. Ribet, and F. Vernadat. The tool tina -construction of abstract state spaces for petri nets and time petri nets. In International Journal of Production Research, 2004.
  215. B. Berthomieu and F. Vernadat. State class constructions for branching analysis of time petri nets. In In Proc. of TACAS'03, volume 2619 of LNCS, pages 442-457. Springer-Verlag, 2003.
  216. H. Boucheneb and R. Hadjidj. Ctl* model checking for time petri nets. Theoretical Computer Science, TCS 353(1-3):208-227, 2006.
  217. Alexandre David, Lasse Jacobsen, Morten Jacobsen, Kenneth Yrke Jørgensen, Mikael H. Møller, and Jirí Srba. Tapaal 2.0: Integrated development environment for timed-arc petri nets. In TACAS, pages 492-497, 2012.
  218. D. Lime G. Gardey, M. Magnin, and O.H. Roux. Roméo: A tool for analyzing time petri nets. In In 17th International Conference on Computer Aided Verification (CAV'05), 2005.
  219. R. Hadjidj. Analyse et validation formelle des systèmes temps réel. Ph.D. Theses,University of Montreal (Ecole plytechnique), 2006.
  220. R. Hadjidj and H. Boucheneb. On the fly TCTL model checking for time petri nets using the state class method. In In Proc of ACSD'06, pages 111-120. IEEE Computer Society Press, 2006.
  221. R. Hadjidj and H. Boucheneb. On the fly TCTL model checking for time petri nets. Theo- retical Computer Science, TCS 410(42):4241-4261, 2009.
  222. R. Hadjidj and H. Boucheneb. Efficient reachability analysis for time petri nets. IEEE Transaction on Computers, 60(8):1085-1099, 2011.
  223. P. Merlin and D. J. Farber. Recoverability of communication protocols -implication of a theoretical study. IEEE Trans. on Communications, 24(9):1036-1043, 1976. References
  224. Antonio Cruz-Lemus, J., Genero, M., Piattini, M.: Metrics for UML Statechart Diagrams. In: Genero, M., Piattini, M., Calero, C. (eds.) Metrics for Software Con- ceptual Models, pp. 237-272. Imperial College Press, London (2005)
  225. Bultan, T., Fu, X.: Specification of realizable service conversations using collabora- tion diagrams. Service Oriented Computing and Applications 2(1), 27-39 (2008)
  226. Miyamoto, T., Hasegawa, Y.: A Petri Net Approach to Synthesize Intelligible State Machine Models from Choreography. In: International Workshop on Petri Nets and Software Engineering 2012. pp. 222-236 (Jun 2012)
  227. OMG: Unified modeling language, http://www.uml.org/
  228. Su, J., Bultan, T., Fu, X., Zhao, X.: Towards a theory of web service choreographies. In: Proceedings of the 4th international conference on Web services and formal methods. pp. 1-16 (2008)
  229. Thomas, E.: Service-Oriented Architecture. Prentice Hall (2004) References
  230. T. Winter et. al. RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks. RFC 6550, 2012. Internet Engineering Task Force.
  231. K. Jensen, L.M. Kristensen, and L. Wells. Coloured Petri Nets and CPN Tools for Modelling and Validation of Concurrent Systems. International Journal on Software Tools for Technology Transfer, 9(3-4):213-254, 2007.
  232. P. Levis. TinyOS Programming. Cambridge University Press, 2009.
  233. K. Simonsen, L.M. Kristensen, and E. Kindler. Code Generation for Protocols from CPN Models Annotated with Pragmatics. In Proc. of NWPT'12, volume 403 of Report in Informatics, pages 46-48. University of Bergen, 2012.
  234. V. Veiset. An Approach to Semi-Automatic Code Generation for the TinyOS Plat- form using Coloured Petri Nets. Master's thesis, Bergen University College, 2013.
  235. M. Westergaard. Access/CPN 2.0: A High-Level Interface to CPN Models. In Proc. of ICATPN'11, volume 6709 of LNCS, pages 328-337. Springer, 2011. ModBE'13 Proceedings Part VI ModBE'13: Invited Talk Knowledge and Business Intelligence Technologies in Cross- Enterprise Environments for Italian Advanced Mechanical Industry Ernesto Damiani and Paolo Ceravolo . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Part VII ModBE'13: Long Presentations Optimizing Algebraic Petri Net Model Checking by Slicing Yasir Imtiaz Khan and Matteo Risoldi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . A Proposal for the Modeling of Organizational Structures and Agent Knowledge in MAS Lawrence Cabac, David Mosteller, Matthias Wester-Ebbinghaus . . . . . . . . Mining Declarative Models Using Time Intervals Jan Martijn van der Werf, Ronny Mans and Wil van der Aalst . . . . . . . . Part VIII ModBE'13: Short Presentation Improving Emergency Department Processes Using Coloured Petri Nets Khodakaram Salimifard, Seyed Yaghoub Hosseini and Mohammad Sadegh Moradi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Part IX ModBE'13: Poster Abstracts Advantages of a Full Integration between Agents and Workflows Thomas Wagner and Lawrence Cabac . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Cloud Transition for QoS Modeling of Inter-Organizational Workflows Sofiane Bendoukha and Lawrence Cabac . . . . . . . . . . . . . . . . . . . . . . . . . . . . References
  236. D. Buchs, S. Hostettler, A. Marechal, A. Linard, and M. Risoldi. Alpina: A sym- bolic model checker. Springer Berlin Heidelberg, pages 287-296, 2010.
  237. J. R. Burch, E. Clarke, K. L. McMillan, D. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. In Logic in Computer Science, 1990. LICS '90, Proceedings., Fifth Annual IEEE Symposium on e, pages 428-439, 1990.
  238. J. Chang and D. J. Richardson. Static and dynamic specification slicing. In In Proceedings of the Fourth Irvine Software Symposium, 1994.
  239. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite- state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8:244-263, 1986.
  240. S. Hostettler, A. Marechal, A. Linard, M. Risoldi, and D. Buchs. High-level petri net model checking with alpina. Fundamenta Informaticae, 113(3-4):229-264, Aug. 2011.
  241. K. Jensen. Coloured petri nets. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Central Models and Their Properties, volume 254 of Lecture Notes in Computer Science, pages 248-299. Springer Berlin Heidelberg, 1987.
  242. Y. I. Khan. A formal approach for engineering resilient car crash management system. Technical Report TR-LASSY-12-05, University of Luxembourg, 2012.
  243. L. Lamport. What good is temporal logic. Information processing, 83:657-668, 1983.
  244. W. J. Lee, H. N. Kim, S. D. Cha, and Y. R. Kwon. A slicing-based approach to enhance petri net reachability analysis. Journal of Research Practices and Infor- mation Technology, 32:131-143, 2000.
  245. M. Llorens, J. Oliver, J. Silva, S. Tamarit, and G. Vidal. Dynamic slicing techniques for petri nets. Electron. Notes Theor. Comput. Sci., 223:153-165, Dec. 2008.
  246. A. Rakow. Slicing petri nets with an application to workflow verification. In Proceedings of the 34th conference on Current trends in theory and practice of computer science, SOFSEM'08, pages 436-447, Berlin, Heidelberg, 2008. Springer- Verlag.
  247. A. Rakow. Slicing and Reduction Techniques for Model Checking Petri Nets. PhD thesis, University of Oldenburg, 2011.
  248. A. Rakow. Safety slicing petri nets. In S. Haddad and L. Pomello, editors, Applica- tion and Theory of Petri Nets, volume 7347 of Lecture Notes in Computer Science, pages 268-287. Springer Berlin Heidelberg, 2012.
  249. W. Reisig. Petri nets and algebraic specifications. Theor. Comput. Sci., 80(1):1-34, 1991.
  250. K. Schmidt. T-invariants of algebraic petri nets. Informatik-Bericht, 1994.
  251. A. Valmari. The state explosion problem. In Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets, pages 429-528, London, UK, UK, 1998. Springer-Verlag.
  252. M. Weiser. Program slicing. In Proceedings of the 5th international conference on Software engineering, ICSE '81, pages 439-449, Piscataway, NJ, USA, 1981. IEEE Press. This work has been supported by the National Research Fund, Luxembourg, Project MOVERE, ref.C09/IS/02. References
  253. Olivier Boissier, Jomi Hübner, and Jaime Simão Sichman. Organization ori- ented programming: From closed to open organizations. In G. O'Hare, A. Ricci, M. O'Grady, and O. Dikenelli, editors, Engineering Societies in the Agents World VII, volume 4457 of Lecture Notes in Computer Science, pages 86-105. Springer, 2007.
  254. Lawrence Cabac. Multi-agent system: A guiding metaphor for the organization of software development projects. In Paolo Petta, editor, Proceedings of the Fifth German Conference on Multiagent System Technologies, volume 4687 of Lecture Notes in Computer Science, pages 1-12, Leipzig, Germany, 2007. Springer-Verlag.
  255. Lawrence Cabac. Modeling Petri Net-Based Multi-Agent Applications, volume 5 of Agent Technology -Theory and Applications. Logos Verlag, Berlin, 2010.
  256. Lawrence Cabac, Ragna Dirkner, and Daniel Moldt. Modeling with service depen- dency diagrams. In Daniel Moldt, Ulrich Ultes-Nitsche, and Juan Carlos Augusto, editors, Proceedings of the 6th International Workshop on Modelling, Simulation, Verification and Validation of Enterprise Information Systems, MSVVEIS-2008, In conjunction with ICEIS 2008, Barcelona, Spain, June 2008, pages 109-118, Portugal, 2008. INSTICC PRESS.
  257. Lawrence Cabac, Ragna Dirkner, and Heiko Rölke. Modelling service dependen- cies for the analysis and design of multi-agent applications. In Daniel Moldt, editor, Proceedings of the Fourth International Workshop on Modelling of Objects, Components, and Agents. MOCA'06, number FBI-HH-B-272/06 in Report of the Department of Informatics, pages 291-298, Vogt-Kölln Str. 30, D-22527 Hamburg, Germany, June 2006. University of Hamburg, Department of Informatics.
  258. Lawrence Cabac, Till Dörges, Michael Duvigneau, Daniel Moldt, Christine Reese, and Matthias Wester-Ebbinghaus. Agent models for concurrent software systems. In Ralph Bergmann and Gabriela Lindemann, editors, Proceedings of the Sixth German Conference on Multiagent System Technologies, MATES'08, volume 5244 of Lecture Notes in Artificial Intelligence, pages 37-48, Berlin Heidelberg New York, 2008. Springer-Verlag.
  259. Lawrence Cabac and Daniel Moldt. Support for modeling roles and depen- dencies in multi-agent systems. In Michael Köhler-Bußmeier, Daniel Moldt, and Olivier Boissier, editors, Organizational Modelling, International Workshop, OrgMod'09. Proceedings, Technical Reports Université Paris 13, pages 15-33, 99, avenue Jean-Baptiste Clément, 93 430 Villetaneuse, June 2009. Université Paris 13. Preeproceedings available online at http://www.informatik.uni-hamburg. de/TGI/events/orgmod09/#proceedings.
  260. Luciano Coutinho, Jaime Sichmann, and Olivier Boissier. Modelling dimensions for agent organizations. In Virginia Dignum, editor, Handbook of Research on Multi- Agent Systems: Semantics and Dynamics of Organizational Models, pages 18-50. Information Science Reference, 2009.
  261. Virginia Dignum. The role of organization in agent systems. In Virginia Dignum, editor, Handbook of Research on Multi-Agent Systems: Semantics and Dynamics of Organizational Models, pages 1-16. Information Science Reference, 2009.
  262. Christian Ensel and Alexander Keller. An approach for managing service depen- dencies with xml and the resource description framework. Journal of Network and Systems Management, 10:147-170, 2002.
  263. Jacques Ferber, Olivier Gutknecht, and Fabien Michel. From agents to organiza- tions: An organizational view of multi-agent systems. In Paolo Giorgini, Jörg P. Müller, and James Odell, editors, Agent-Oriented Software Engineering IV, 4th International Workshop, AOSE 2003, Melbourne, Australia, Ju ly 15, 2003, Re- vised Papers, volume 2935 of Lecture Notes in Computer Science, pages 214-230.
  264. Foundation for Intelligent Physical Agents (FIPA). FIPA SL Content Language Specification. http://www.fipa.org/specs/fipa00008/index.html, 2002.
  265. R. Gopal. Layered model for supporting fault isolation and recovery. In Network Operations and Management Symposium, 2000. NOMS 2000. 2000 IEEE/IFIP, pages 729-742. IEEE, 2000.
  266. C. Hahn, S. Jacobi, and D. Raber. Enhancing the interoperability between mul- tiagent systems and service-oriented architectures through a model-driven ap- proach. In Web Intelligence and Intelligent Agent Technology (WI-IAT), 2010
  267. IEEE/WIC/ACM International Conference on, volume 2, pages 415-422. IEEE, 2010.
  268. Bryan Horling and Victor Lesser. A survey of multi-agent organizational paradigms. The Knowledge Engineering Review, 19(4):281-316, 2005.
  269. Michael Köhler, Daniel Moldt, and Heiko Rölke. Modelling the structure and behaviour of Petri net agents. In J.M. Colom and M. Koutny, editors, Proceedings of the 22nd Conference on Application and Theory of Petri Nets 2001, volume 2075 of Lecture Notes in Computer Science, pages 224-241. Springer-Verlag, 2001.
  270. Michael Köhler-Bußmeier, Daniel Moldt, and Matthias Wester-Ebbinghaus. A for- mal model for organisational structures behind process-aware information systems. volume 5460 of Lecture Notes in Computer Science, pages 98-115. Springer-Verlag, 2009.
  271. Michael Köhler-Bußmeier, Matthias Wester-Ebbinghaus, and Daniel Moldt. Gen- erating executable multi-agent system prototypes from sonar specifications. In Nicoletta Fornara and George Vouros, editors, 11th Workshop on Coordination, Organizations, Institutions, and Norms in Agent Systems, COIN@Mallow 2010, pages 82-97, 2010.
  272. Xinjun Mao and Eric Yu. Organizational and social concepts in agent oriented software engineering. In James Odell, Paolo Giorgini, and Jörg Müller, editors, Agent-Oriented Software Engineering V, volume 3382 of Lecture Notes in Computer Science, pages 1-15. Springer Berlin / Heidelberg, 2005.
  273. David Mosteller. Entwicklung eines Werkzeugs zur Modellierung der initialen Wis- sensbasen und Rollen-Abhängigkeiten in Multiagentenanwendungen im Kontext von PAOSE / MULAN. Bachelor's thesis, University of Hamburg, Department of Informatics, December 2010.
  274. Lin Padgham and Michael Winikoff. Developing Intelligent Agent Systems : A Practical Guide. Wiley Series in Agent Technology. Chichester [u.a.] : Wiley, 2004. isbn:0-470-86120-7, Pages 225.
  275. Heiko Rölke. Modellierung von Agenten und Multiagentensystemen -Grundlagen und Anwendungen, volume 2 of Agent Technology -Theory and Applications. Logos Verlag, Berlin, 2004.
  276. Carla T. L. L. Silva and Jaelson Castro. Modeling organizational architectural styles in UML: The tropos case. In Oscar Pastor and Juan Sánchez Díaz, editors, Anais do WER02 -Workshop em Engenharia de Requisitos, pages 162-176, 11 2002.
  277. Andre L.C. Tavares and Marco Tulio Valente. A gentle introduction to OSGi. SIGSOFT Softw. Eng. Notes, 33:8:1-8:5, August 2008.
  278. Franco Zambonelli, Nicholas Jennings, and Michael Wooldridge. Developing multi- agent systems: The Gaia methodology. ACM Transactions on Software Engineering and Methodology, 12(3):317-370, 2003.
  279. Ingo Zinnikus, Gorka Benguria, Brian Elvesaeter, Klaus Fischer, and Julien Vayssière. A model driven approach to agent-based service-oriented architectures. In Klaus Fischer, Ingo Timm, Elisabeth André, and Ning Zhong, editors, Multi- agent System Technologies, volume 4196 of Lecture Notes in Computer Science, pages 110-122. Springer Berlin / Heidelberg, 2006.
  280. W.M.P. van der Aalst. Process Mining: Discovery, Conformance and Enhancement of Busi- ness Processes. Springer-Verlag, Berlin, 2011.
  281. W.M.P. van der Aalst, M. Pesic, and M.H. Schonenberg. Declarative workflows: Balancing between flexibility and support. Computer Science -Research and Development, 23:99-113, 2009.
  282. W.M.P. van der Aalst and C. Stahl. Modeling Business Processes -Ű A Petri Net-Oriented Approach. The MIT Press, 2011.
  283. W.M.P. van der Aalst, A.J.M.M. Weijters, and L. Maruster. Workflow Mining: Discovering Process Models from Event Logs. Knowledge & Data Engineering, 16(9):1128-1142, 2004.
  284. A.V. Aho, M. R. Garey, and J. D. Ullman. The Transitive Reduction of a Directed Graph. SIAM Journal on Computing, 1(2):131-137, June 1972.
  285. J.F. Allen. Towards a general theory of action and time. Artificial Intelligence, 23(2):123- 154, July 1984.
  286. J.F. Allen. Actions and Events in Interval Temporal Logic 1 Introduction. Journal of Logic and Computation, 4:531-579, 1994.
  287. E. Clarke and E. Emerson. Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic. In Logics of Programs, volume 131 of LNCS, pages 52- 71. Springer-Verlag, Berlin, 1982.
  288. P. Degano and U. Montanari. Concurrent Histories: A Basis for Observing Distributed Sys- tems. Journal of Computer and System Sciences, 34(2-3):422-461, 1987.
  289. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
  290. P.C Fishburn. Interval graphs and interval orders. Discrete Mathematics, 55(2):135-149, July 1985.
  291. T. Gschwandtner, J. Gärtner, W. Aigner, and S. Miksch. A Taxonomy of Dirty Time-Oriented Data. In G. Quirchmayr, J. Basl, I. You, and E. Weippl, editors, CD-ARES 2012, volume 7465 of LNCS, pages 58-72. Springer, 2012.
  292. T. Hildebrandt, R. Mukkamala, and T. Slaats. Nested dynamic condition response graphs. Fundamentals of Software Engineering, pages 343-350, 2012.
  293. R. Janicki and M. Koutny. Structure of concurrency. Theoretical Computer Science, 112(1):5-52, April 1993.
  294. Wen. L., J. Wang, W.M.P. van der Aalst, B. Huang, and J. Sun. A Novel Approach for Process Mining based on Event Types. Journal of Intelligent Information Systems, 32:163- 190, 2009.
  295. R.D. Luce. Semiorders and a Theory of Utility Discrimination. Econometrica, 24(2):178- 191, 1956.
  296. F.M. Maggi, R.P.J.C. Bose, and W.M.P. van der Aalst. Efficient discovery of understandable declarative process models from event logs. In CAiSE, volume 7328 of LNCS, pages 270- 285. Springer-Verlag, Berlin, 2012.
  297. D.M. Moyles and G.L. Thompson. An algorithm for finding the minimum equivalent graph of a digraph. Journal of the ACM, pages 455 -460, 1969.
  298. J. Nakatumba and W.M.P. van der Aalst. Analyzing Resource Behavior Using Process Min- ing.
  299. In S. et al. Rinderle-Ma, editor, BPM 2009 Workshops, volume 43 of LNBIP, pages 69-80. Springer, 2009.
  300. S.S Pinter and M. Golani. Discovering Workflow Models from Activities' Lifespans. Com- puters in Industry, 53:283-296, 2004.
  301. Y.-L. Qu and T.-S. Zhao. Building Process Models Based on Inverval Logs. In M. Ma, editor, Communication Systems and Information Technology, volume 100 of LNEE, pages 71-78.
  302. G. Rosu and S. Bensalem. Allen Linear (Interval) Temporal Logic -Translation to LTL and Monitor. In Computer Aided Verification, pages 263-277. Springer, 2006.
  303. H.M.W. Verbeek, J.C.A.M. Buijs, B.F. van Dongen, and W.M.P. van der Aalst. XES, XE- Same, and ProM 6. In Information System Evolution, volume 72, pages 60-75. Springer, 2011.
  304. J. de Weerdt, M. de Backer, J. Vanthienen, and B. Baesens. A Multi-dimensional Quality Assessment of State-of-the-Art Process Discovery Algorithms using Real-Life Event Logs. Information Systems, 37:654-676, 2012.
  305. M. Weidlich, J. Mendling, and M. Weske. Efficient consistency measurement based on be- havioral profiles of process models. IEEE Trans. Software Eng., 37(3):410 -429, 2011.
  306. M. Weidlich and J.M.E.M. van der Werf. On Profiles and Footprints -Relational Semantics for Petri Nets. In Application and Theory of Petri Nets, LNCS, pages 148-167. Springer, 2012.
  307. J.M.E.M. van der Werf, B.F. van Dongen, C.A.J. Hurkens, and A. Serebrenik. Process Dis- covery Using Integer Linear Programming. Fundamenta Informatica, 94(3 -4):387 -412, 2009.
  308. N. Wiener. A contribution to the theory of relative position. Proceedings of the Cambridge Philosophical Society, 17:441-449, 1914.
  309. N. Wiener. A new theory of measurement: A study in the logic of mathematics. Proceedings of the London Mathematical Soc., s2-19(1):181-205, 1921.
  310. Buckley, B., Castillo, E., Killeen, J., Guss, D., Chan, T.: Impact of an express admit unit on emergency department length of stay. Journal of emergency medicine 39(5), 669-673 (Nov 2010)
  311. Soremekun, O., Takayesu, J., Bohan, S.: Framework for analyzing wait times and other factors that impact patient satisfaction in the energency department. The Journal of Emergency Medicine 41(6), 686-692 (2011)
  312. Holden, R.: Lean Thinking in Emergency Departments: A Critical Review. Annals of Emergency Medicine 57(3), 265-278 (2010)
  313. Eitel, , Rudkin, S., Malvehy, A., Killeen, J., Pines, J.: Improving service quality by understanding emergency department flow: a white paper and position statement prepared for the american academy of emergency medicine. The Journal of Emergency Medicine 38(1), 70-79 (2010)
  314. Zeng, Z., Ma, X., Hu, , Li, J.: A simulation study to improve quality of care in the emergency department of a community hospital. Journal of Emergency Nursing 38(4), 322- 328 (2011)
  315. Baldwin, L., Eldabi, T., Paul, R.: Simulation in healthcare management:a soft approach (MAPIU). Simulation Modelling Practice and Theory 12(7 -8), 541 -557 (2004)
  316. Alvarez , A., Centeno , : Enhancing simulation models foremergency rooms using VBA. In : Proceedings of the I999 Winter Simulation Conference, New York, NY, USA, vol. 2, pp.1685-1693 (1999)
  317. Villamizar, J., Coelli, F., Pereira, W., Almeida, R.: Discrete-event computer simulation methods in the optimisation of a physiotherapy clinic. Physiotherapy 97(1), 71 -77 (2011)
  318. Hoot, N., LeBlanc, , Jones, I., Levin, S., Zhou, , Gadd, C., Aronsky, D.: Forecasting Emergency Department Crowding: A Discrete Event Simulation. Annals of Emergency Medicine 52(2), 116-125 (2008)
  319. Kolb , E., Peck , J., Schoening , S., Lee , T.: Reducing emergency department overcrowding -five patient buffer in comparison. In : Proceedings of the 2008 Winter Simulation Conference, Austin, TX, pp.1516-1525 (2008)
  320. Khandekar, S., Mari, J., Wang, S., Gandhi, T.: Implementation of Structural Changes to the Care Process in the Emergency Department using Discrete Event Simulation. In : Proceedings of the 2007 Industrial Engineering Research Conference (2007)
  321. Nagula, P.: Redesigning the patient care delivery processes at an emergency department., New York (2006)
  322. Park, , Park, J., Ntuen, , Kim, D., Johnson, K.: Forecast Driven Simulation Model for Service Quality Improvement of the Emergency Department in the Moses H. Cone Memorial Hospital. The Asian Journal on Quality 9(3) (2008)
  323. Khadem, M., Bashir, H., Al-Lawati, Y., Al-Azri, F.: Evaluating the Layout of the Emergency Department of a Public Hospital Using Computer Simulation Modeling: A Case Study. In : Industrial Engineering and Engineering and Management, Singapore, pp.1709-1713 (2008)
  324. Gonzilez, , Gonzilez, , Rios, N.: Improving the quality of service in an emergency room using simulation-animation and total quality management. In : Proceedings of the 21st international conference on Computers and industrial engineering, Tarrytown, NY, USA , vol. 33, pp.97-100 (1997)
  325. Xiong, , Zhou, M., Manikopoulos, : Modeling and Performance Analysis of Medical Services Systems Using Petri Nets. In : Systems, Man, and Cybernetics, San Antonio, TX, pp.2339-2342 (1994)
  326. Chockalingam, A., Jayakumar, , Lawley, : A stochastic cotrol approach to avoiding emergencydepartment overcrowding. In : Proceedings of the 2010 Winter Simulation Conference, Baltimore, MD, pp.2399-2411 (2010)
  327. Dotoli, M.: Modeling and Management of a Hospital Department via Petri Nets. In : 2010 IEEE Workshop on Health Care Management (WHCM), Venice, pp.1-6 (2010)
  328. Mans, R., Schonenberg, H., Leonardi, G., Panzarasa, S., Cavallini, A., Quaglini, S., van der AALST, W.: Process Mining Techniques: an Application to Stroke Care 136. Stud Health Technol Inform (2008)
  329. Jørgensen, J., Lassen, K., van der Aalst, W. M.: From task descriptions via Coloured Petri nets towards an implementation of a new electronic patient record workflow system. International Journal on Software Tools for Technology Transfer 10(1), 15-28 (2008)
  330. CPN Tools. In: AIS group, Eindhoven University of Technology, The Netherlands. (Accessed 2012) Available at: http://www.cpntools.org
  331. Günal , M., Pidd , : Moving from specific to generic: Generic modelling in health care. In : Proceedings of the 2007 INFORMS Simulation Society Research Workshop (2007)
  332. Jensen, K., Kristensen, L.: Coloured Petri Nets , Modelling and Validation of Concurrent Systems. Springer, Denmark (2009)
  333. Jensen, K.: An introduction to the practical Use of coloured Petri nets. Lecture Notes in Computer Sciencee, Springer-Verlag, 1-14 (1996) References
  334. P. Czarnul, M. Matuszek, M. Wójcik, and K. Zalewski. BeesyBees -efficient and reliable execution of service-based workflow applications for BeesyCluster using dis- tributed agents. In Proceedings of IMCSIT 2010, pages 173 -180, oct. 2010.
  335. F. Hsieh. Collaborative Workflow Management in Holonic Multi-Agent Systems. In J. O'Shea et al., editors, Agent and Multi-Agent Systems: Technologies and Appli- cations, volume 6682 of LNCS, pages 383-393. Springer Berlin Heidelberg, 2011.
  336. A. Mislevics and J. Grundspenkis. Workflow based approach for designing and executing mobile agents. In Digital Information Processing and Communications (ICDIPC), 2012 Second International Conference on, pages 96 -101, july 2012. References
  337. Sofiane Bendoukha and Thomas Wagner. Cloud transition: Integrating cloud calls into workflow Petri nets. In Lawrence Cabac, Michael Duvigneau, and Daniel Moldt, editors, PNSE, volume 851 of CEUR Workshop Proceedings, June 2012.
  338. Thomas Jacob, Olaf Kummer, Daniel Moldt, and Ulrich Ultes-Nitsche. Implemen- tation of workflow systems using reference nets -security and operability aspects. In Kurt Jensen, editor, Fourth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, August 2002.
  339. Suraj Pandey, Dileban Karunamoorthy, and Rajkumar Buyya. Workflow Engine for Clouds, pages 321-344. John Wiley & Sons, Inc., 2011.

Related papers

Application and Theory of Petri Nets and Concurrency - 34th International Conference, PETRI NETS 2013, Proceedings
Stefan Haar

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013

These are the proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE'13) in Milano, Italy, June 24-25, 2013. It is a co-located event of Petri Nets 2013, the 34th international conference on Applications and Theory of Petri Nets and Concurrency. More information about the workshop can be found at http://www.informatik.uni-hamburg.de/TGI/events/pnse13/ For the successful realisation of complex systems of interacting and reactive software and hardware components the use of a precise language at different stages of the development process is of crucial importance. Petri nets are becoming increasingly popular in this area, as they provide a uniform language supporting the tasks of modelling, validation, and verification. Their popularity is due to the fact that Petri nets capture fundamental aspects of causality, concurrency and choice in a natural and mathematically precise way without compromising readability. The use of Petri Nets (P/T-Nets, Coloured Petri Nets and extensions) in the formal process of software engineering, covering modelling, validation, and verification, will be presented as well as their application and tools supporting the disciplines mentioned above.

View PDFchevron_right
Petri Nets based Formal Modeling and Verification of Concurrent Systems
Ilyas Fakhir

2019

The assurance of required quality properties is one of the major challenge in SelfAdaptive Systems (SAS). Self-adaptive systems have the capability to adapt their dynamic behavior autonomously at runtime due to uncertain changes in the environment. Research in this field is being held since mid-sixties, and over the last decade the importance of self-adaptivity is being increased. In general a self-adaptive system is much difficult to specify and verify, because of its highly complex internal behavior and especially when time constraints are involved. In the proposed research, Colored Petri Net (CPN) formal language will be used to model self-adaptive multi-agent system. CPN is increasingly used to model self-adaptive complex concurrent systems due to its flexible formal specification and formal verification behavior. CPN is visually more expressive than simple Petri Nets enables diverse modeling approaches and provides a richer framework for such a complex formalism. The specificat...

View PDFchevron_right
Transactions on Petri Nets and Other Models of Concurrency II
Jörg Desel

Lecture Notes in Computer Science, 2009

View PDFchevron_right
From Petri NETS to Colored Petri NETS: A Tutorial Introduction to NETS Based Formalism For Modeling And Simulation
Vijay Gehlot

2019

Petri Net, a widely studied mathematical formalism, is a graphical notation for modeling systems. Petri Nets provide the foundation for modeling concurrency, communication, synchronization, and resource sharing constraints that are inherent to many systems. However, Petri Nets do not scale well when it comes to modeling and simulating large systems. Colored Petri Nets (CPNs) extend Petri Nets with a high level programming language, making them more suitable for modeling large systems. The CPN language allows the creation of models as a set of modules in a hierarchical manner and permits both timed and untimed models. Untimed models are used to validate the logical correctness of a system, whereas timed models are used to evaluate performance. This tutorial introduces the reader to the vocabulary and constructs of both Petri Nets and CPNs and illustrates the use of CPN Tools in creating and simulating models by means of familiar simple examples.

View PDFchevron_right
A Systematic Approach to the Petri Net Based Specification of Concurrent Systems
Stefano Russo

Real-time Systems, 1997

We describe an approach to the specification of concurrent systems which enables a Petri net model of a system to be built up in a systematic way starting from a trace-based CSP specification. This method enables the separate specification of the behavior of each component (process) and their interactions in terms of the feasible sequences of events in which they can be involved. A set of rules is then applied to transform the trace-based specifications into a complete Petri net that is analyzed and/or executed to validate system behavior. The domain transformation procedure is fully automatable. The specification of a safety-critical railway control system is used as a case study.

View PDFchevron_right

Related topics

  • Computer Science

    • Cited by

    Using Worker Position Data for Human-Driven Decision Support in Labour-Intensive Manufacturing
    Andrew Sherlock

    Sensors, 2023

    This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved