Effective representation of RT-LOTOS terms by finite time petri nets

The paper describes a transformational approach for the specification and formal verification of concurrent and real-time systems. At upper level, one system is specified using the timed process algebra RT-LOTOS. The output of the proposed transformation is a Time Petri net (TPN). The paper particularly shows how a TPN can be automatically constructed from an RT-LOTOS specification using a compositionally defined mapping. The proof of the translation consistency is sketched in the paper and developed in [1]. The RT-LOTOS to TPN translation patterns formalized in the paper are being implemented. in a prototype tool. This enables reusing TPNs verification techniques and tools for the profit of RT-LOTOS

The Symmetry Method for Coloured Petri Nets

This booklet is the author's PhD-dissertation

Designing tool support for translating use cases and UML 2.0 Sequence Diagrams into a Coloured Petri Net

Using a case study on the specification of an elevator controller, this paper presents an approach that can translate given UML descriptions into a Coloured Petri Net (CPN) model. The UML descriptions must be specified in the form of Use Cases and UML 2.0 Sequence Diagrams. The CPN model constitutes one single, coherent and executable representation of all possible behaviours that are specified by the given UML artefacts. CPNs consitute a formal modelling language that enables construction and analysis of scalable, executable models of behaviour. A combined use of UML and CPN can be useful in several projects. CPN is well supported by CPN Tools and the work we present here is aimed at building a CPN Tools front-end engine that implements the proposed translation.Fundação para a Ciência e a Tecnologia (FCT) - SFRH/BSAB/607/200

Comparative Analysis of Different Tools Business Process Simulation

Business process modelling is an increasingly popular research area for both organisations and enterprises due to its usefulness in facilitating better planning of resources, business reengineering and optimized business performance. The modelling and simulation of Business Processes has been able to show Business Analysts, and Managers where bottleneck exists in the system, how to optimize the Business Process to reduce cost of running the Organization, and the required resources needed for an Organization An important part of the evaluation of designed and redesigned business processes is Business Process Simulation (BPS). Although an abundance of simulation tools exist, the applicability of these tools is diverse. In this paper we thrash out a number of simulation tools that are applicable for the BPM field, we estimate their applicability for BPS and formulate recommendations for further research. This paper is limited to analysis three tools that is IBM WebSphere, FLOWer and FileNet (process management); and Arena and CPN Tools (discrete event simulation)) are compared based on the capabilities of modelling, support of simulation and output analysis

Mapping RT-LOTOS specifications into Time Petri Nets

RT-LOTOS is a timed process algebra which enables compact and abstract specification of real-time systems. This paper proposes and illustrates a structural translation of RT-LOTOS terms into behaviorally equivalent (timed bisimilar) finite Time Petri nets. It is therefore possible to apply Time Petri nets verification techniques to the profit of RT-LOTOS. Our approach has been implemented in RTL2TPN, a prototype tool which takes as input an RT-LOTOS specification and outputs a TPN. The latter is verified using TINA, a TPN analyzer developed by LAAS-CNRS. The toolkit made of RTL2TPN and TINA has been positively benchmarked against previously developed RT-LOTOS verification tool

CPN Modelling And Performance Analysis Of CBHSA

Security is a major issue associated with MAs and Hosts. MAs themselves may need to be protected from the hosts they visit and vice versa. For mobile multi agents, a new Cryptography Based Hierarchical Security Architecture (CBHSA) has already been proposed in our previous work. CBHSA provides four different kinds of algorithms to secure agents during migration which combines various existing security mechanisms such as encryption and decryption, signed agreement etc. This paper gives the description of Colored Petri Net (CPN) modelling of CBHSA and analyses the performance of CBHSA against some identified parameters. Different graphs have been developed for min, max and average values of different parameters. Simulation results show that CBHSA gives expected result and secure MAs and hosts from attacks

Structuring and composability issues in Petri nets modeling

Along Petri nets' history, numerous approaches have been proposed that try to manage model size through the introduction of structuring mechanisms allowing hierarchical representations and model composability. This paper proposes a classification system for Petri nets' structuring mechanisms and discusses each one of them. These include node fusion, node vectors, high-level nets, and object-oriented inspired Petri nets extensions, among others. One running example is used emphasizing the application of the presented mechanisms to specific areas, namely to automation systems modeling, and software engineering, where object-oriented modeling plays a major role

On the compared expressiveness of arc, place and transition time Petri nets

International audienceIn this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (TPPN), arcs (TAPN) or transitions (TTPN). We give the formal strong and weak semantics of these models in terms of Timed Transition Systems. We compare the expressiveness of the six models w.r.t. (weak) timed bisimilarity (behavioral semantics). The main results of the paper are : (i) with strong semantics, TAPN is strictly more expressive than TPPN and TTPN ; (ii) with strong semantics TPPN and TTPN are incomparable ; (iii) TTPN with strong semantics and TTPN with weak semantics are incomparable. Moreover, we give a complete classification by a set of 9 relations explained in a figure

A Case Study on Coloured Petri Nets in object-oriented analysis and design

Selected Papers of the Second International Workshop on Model-Based Methodologies for Pervasive and Embedded Software (MOMPES'05), June 6, 2005, Rennes, France.In this paper,we first demonstrate how a coloured Petri nets(CPN) model can be used to capture requirements for a considered example system, an elevator controller. Then, we show how this requirements-level CPN model is transformed into a design-level object-oriented CPN model, which is structurally and conceptually closer to class diagrams and object-oriented programming languages. The CPN models reduce the gap between user-level requirements and the respective implementation, thus simplifying the imple- mentation or code generation. Finally, we discuss the code generation from object-oriented CPN models