You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.
The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.
For the reports in this repository we specifically note that
- the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
- the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
- technical reports and other articles issued by MÃ¤lardalen University is free for personal use. For other use, the explicit consent of the authors is required
- in other cases, please contact the copyright owner for detailed information
By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.
If you are in doubt, feel free to contact email@example.com
Petri Nets - Towards a formal analysis approach based on the use of Colored Petri Nets, Timed Colored Petri Nets and the CPN Tools
This presentation provides an introduction to the use of Colored Petri Nets and Timed Colored Petri Nets for building, simulation and formal analysis of system models by the use of CPN Tools. Colored Petri Nets is a high-level Petri Net language that combines a well defined formal semantics, an explicit representation of both states and events, an easy to understand and intuitively appealing graphical representation and the modeling flexibility provided by a programming language (due to the support of complex data types). Colored Petri Nets have been developed over the last 28 years and today constitute a mature modeling language, which allows flat or hierarchical descriptions of control and synchronization to be integrated with the description of data manipulation.
We present an automata based model building approach and a state space based formal analysis of standard dynamic properties like boundedness, liveness and fairness. System properties that imply certain temporal relationships between a set of events are expressed and checked based on the use of a Computation Tree like Temporal Logic (CTL). Also, we refer to alternative analysis methods, like for example the invariants based analysis and its advantages over the state space based analysis. The presentation concludes with a discussion regarding a potential extension of the described approach to the analysis of component based software models and to the schedulability analysis of systems with timing constraints.