Taking advantage of some complementary modelling methods to meet critical system requirement specifications

When designing complex systems, mechanisms for structuring, composing, and reusing system components are crucial. Today, there are many approaches for equipping Petri nets with such mechanisms. In the context of defining a standard interchange format for Petri nets, modular PNML was defined as a mechanism for modules in Petri nets that is independent from a particular version of Petri nets and that can mimic many composition mechanisms by a simple import and export concept. Due to its generality, the semantics of modular PNML was only informally defined. Moreover, modular PNML did not define which concepts could or should be subject to import and export in high-level Petri nets. In this paper, we formalise a minimal version of modular high-level Petri nets, which is based on the concepts of modular PNML. This shows that modular PNML can be formalised once a specific version of Petri net is fixed. Moreover, we present and discuss some more advanced features of modular Petri nets that could be included in the standard. This way, we provide a formal foundation and a basis for a discussion of features to be included in the upcoming standard of a module concept for Petri nets in general and for high-level nets in particular.

The work described in this paper is concerned with modeling and analysing distributed object-oriented real time (RT) systems, developed according to DART — Distributed Architecture for Real Time — which provides an object-oriented life cycle for RT systems. The paper first gives an overview of DART, then discusses the usefulness of mapping DART systems onto high level Petri nets as part of an iterative design process. The resultant framework is a modular operational model, based on a powerful Petri nets tool which delivers both the user-interface utilised for animation purposes and a set of mechanisms suited for the analysis of time-dependent behaviour.Keywordsreal timescheduling analysisdistributed systemsobject-orientationPetri netsanimationexecutable specifications

High level Petri nets (HLPNs) have been widely applied to model concurrent and distributed systems in computer science and many other engineering disciplines. However, due to the expressive power of HLPNs, they are difficult to analyze. In recent years, a variety of new analysis techniques based on model checking have been proposed to analyze high level Petri nets in addition to the traditional analysis techniques such as simulation and reachability (coverability) tree. These new analysis techniques include (1) developing tailored model checkers for particular types of HLPNs or (2) leveraging existing general model checkers through model translation where a HLPN is transformed into an equivalent form suitable for the target model checker. In this paper, we present a term rewriting approach to analyze a particular type of HLPNs -- predicate transition nets (PrT nets). Our approach is completely automatic and implemented in our tool environment, where the frontend is PIPE+, a general graphical editor for creating PrT net models, and the backend is Maude, a well-known term rewriting system. We have applied our approach to the Mondex system -- the 1st pilot project of verified software repository in the worldwide software verification grand challenge, and several well-known problems used in the annual model checking contest of Petri net tools. Our initial experimental results are encouraging and demonstrate the usefulness of the approach.

In this paper, we introduce a framework composed of a syntax and its compositional Petri net semantics, for the specification and verification of properties (like authentication) of security protocols. The protocol agents (e.g., an initiator, a responder, a server, a trusted third party, ...) are formalized as roles, each of them having a predefined behavior depending on their global and also local knowledge (including for instance public, private and shared keys), and may interact in a potentially hostile environment. The main characteristics of our framework, is that it makes explicit, structured and formal, the usually implicit information necessary to analyse the protocol, for instance the public and private contextof execution. The roles and the environment are expressed using SPL processes and compositionally translated into high-level Petri nets, while the context specifying the global and local knowledge of the participants in the protocol is used to generate the corresponding initial marking (with respect to the studied property). Finally, this representation is used to analyse the protocol properties, applying techniques of simulation and model-checking on Petri nets. The complete approach is illustrated on the case study of the Kao-Chow authentication protocol.

Petri net (PN), as a kind of powerful modeling tool for discrete-event dynamic systems, has widely applied in many domains. In this paper, two classes of high-level PN, controlled colored Petri net and controlled hybrid Petri net, are proposed and applied in the unit-commitment (UC) problem for a regional power grid with pumped storage stations. At the same time, the principle of large-scale system decomposition-coordination is applied to solve the problem of optimizing system operation. As a result, the UC problem is further simplified, as well as the algorithm efficiency improved. The proposed solution based on the high-level PN models, dynamic programming and decomposition-coordination theory, provides a new modeling methodology and could result in a superior dispatch plan for a regional power grid. (6 pages)

A problem for hypertext-based learning application is to control learning paths for different learning activities. This paper first introduces related concepts of hypertext learning state space and high level Petri Nets (PNs), then proposes a high level timed PN based approach used to providing kinds of adaptation for learning activities by adjusting time attributes of targeted learning state space. Examples are given while explaining ways to realising adaptive instructions. Possible future directions are also discussed at the end of this paper.

The authors propose a new graphical modelling tool, HyperNets, closely related to high level Petri nets (coloured, predicate-transition). HyperNets semantics is based on point-to-set functions and constraint theories. We associate a graphical representation to a point-to-set representation of HyperNets. The reachability set is characterized by fixed-point semantics. The correctness and completeness of a non-determinist semi-decision algorithm for the accessibility problem is proved. This algorithm also gives fire sequences; high-level Petri nets then appear as a particular case of HyperNets. We have implemented a version of this algorithm for linear HyperNets in the MINOS system.

This paper is concerned with elementary and high-level Petri nets (coloured Petri nets and predicate/transition nets) and their utility for conceptual modeling of information systems. Particular features of existing net classes are discussed and additional net constructs are proposed for that purpose. Adequate conceptual models, i.e., models which reflect an intended view of an information system without any strange or artifical elements are best obtained if the following features are available to the modeler: (i) places have finite capacities (bounded places), (ii) arc expressions denote sets of variable cardinality, (iii) exclusive and shared use of side-conditions can be specified, (iv) terms denoting the set of all entities of a current marking or a specified subset thereof can be used in transition expressions, (v) static properties can be specified in state-oriented terms and impose restrictions on the dynamic properties specified in transition-oriented terms. The paper presents examples of each one of these desirables features and discusses them against the existing high-level Petri net classes or shows how they can be provided without resorting to so-called extensions.

CORBA is a standard proposed by the Object Management Group (OMG) that promotes interoperability between distributed object systems. Following the standardization of this object-oriented middleware, the OMG has specified a set of Common Object Services (COS) that are meant to serve as the building blocks of distributed CORBA applications. The COSes are specified using CORBA Interface Definition Language (IDL), that describes the syntactic aspects of services supported by remote objects. However, CORBA-IDL does not support specification of the behaviour of objects in an abstract and formal way, and behavioural specification is mostly provided in plain English. To overcome this problem, we have proposed a formal description technique (Cooperative Objects) based on high-level Petri nets, and developed a software support environment. The goal of this paper is to demonstrate that our approach is suited to the formal specification of typical CORBA COS, and presents a Cooperative Object model of the CORBA event service, a COS that provides asynchronous, one-to-many communication between objects. The advantages of dealing with a tool-supported, executable formal notation are detailed, as well as the results that can be obtained through Petri net analysis techniques.Key wordsDistributed systemsbehavioural specificationCORBAhigh-level Petri nets

Formalization of process behavior is a key issue for semantic Web services. However, this bears the disadvantage of clumsy specifications. In this paper we introduce a Petri net based approach to capture the semantics of Web services. It offers a visual modeling technique and means of refinement and composition. The model is very formal allowing for a clear specification of the semantics a process has. We combine ideas from the Petri net community with ideas from the description logic area focusing on ontologies

The author presents a tutorial on high-level Petri nets and their applications. The author illustrates the transition firing rule of a high-level Petri net using an example. A high-level net can be considered as a structurally folded version of a regular Petri net, if the number of colors is finite. Thus, a high-level net can be unfolded into a regular Petri net by unfolding each place p into a set of places, one for each color of tokens which p may hold, and by unfolding each transition t into a set of transitions, one for each way that t may fire. The author informally introduces high-level nets through examples. The examples are taken from recent applications of high-level Petri nets to : (1) Horn clause logic programs, (2) four-valued annotated predicate logic, (3) nonmonotonic logic and (4) robot planning.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Petri Nets (PNs) are an effective structure for modeling and analyzing asynchronous systems with concurrent and parallel activities. A Petri net models the static properties of a discrete event system concentrating on two basic concepts: events and conditions. Most of the theoretical work on Petri nets is a formal definition of Petri nets structures, which consist of a set of places, representing conditions, a set of transitions, representing events, an input function and an output function. For practical purposes, a graphical representation is more useful. Two types of nodes portray places and transitions. A circle is a place and a bar is a transition. There is no inherent measure of time in a classical Petri net. To approach time-based evaluation of system performances, Timed Petri Nets (TPNs) were introduced. Modeling the notion of time is not straightforward. There are several possibilities for introducing time in PNs, among them timed transitions and timed places. This paper reviews several published examples where Petri Nets were used in different circumstances such as estimating expected utilization of processing resources at steady state in open queueing networks, verifying computerized simulations and batch planning in textile industry.

We present a novel architecture description language - OPNADL. The domain specific software architecture based on OPNADL is employed to guide the large-scale software development. OPNADL (object-oriented Petri nets architecture description language) is a graphical and mathematical modeling language, which can be used to describe static and dynamic semantics, and analyze the dynamic behavior of software system. The overall and individual characteristics of a system can be visually and intuitively depicted with the proposed OPNADL. Software architecture is conveniently constructed, refined and verified by OPNADL.

Analysis of controlled technological systems using high level petri nets

Qualitative model based verification of operating procedures by high level petri nets