Results 1 - 10
of
24
From Coloured Petri Nets to Object Petri Nets
, 1995
"... ion Abstract: This paper seeks to establish within a formal framework how Coloured Petri Nets can be enhanced to produce Object Petri Nets. It does so by defining a number of intermediate Petri Net formalisms and identifying the features introduced at each step of the development. Object Petri Nets ..."
Abstract
-
Cited by 63 (7 self)
- Add to MetaCart
ion Abstract: This paper seeks to establish within a formal framework how Coloured Petri Nets can be enhanced to produce Object Petri Nets. It does so by defining a number of intermediate Petri Net formalisms and identifying the features introduced at each step of the development. Object Petri Nets support a complete integration of object-oriented concepts into Petri Nets, including inheritance and the associated polymorphism and dynamic binding. In particular, Object Petri Nets have a single class hierarchy which includes both token types and subnet types. Interaction between subnets can be either synchronous or asynchronous depending on whether the subnet is defined as a super place or a super transition. The single class hierarchy readily supports multiple levels of activity in the net and the generation and removal of tokens has been defined so that all subcomponents are simultaneously generated or removed, thus simplifying memory management. Despite this descriptive power, Object...
Coloured Petri Nets Extended with Channels for Synchronous Communication
- Application and Theory of Petri Nets 1994, Proc. of 15th Intern. Conf
"... This paper shows how Coloured Petri Nets (CP-nets) can be extended to support synchronous communication. We introduce coloured communication channels through which transitions are allowed to communicate complex values. Small examples show how channel communication is convenient for creating compa ..."
Abstract
-
Cited by 56 (0 self)
- Add to MetaCart
This paper shows how Coloured Petri Nets (CP-nets) can be extended to support synchronous communication. We introduce coloured communication channels through which transitions are allowed to communicate complex values. Small examples show how channel communication is convenient for creating compact and comprehensive models. The concepts introduced in this paper originate from the practical use of Petri nets for modelling, and they are formally defined in such a way that they preserve the basic properties of CP-nets. We show how a CP-net with channels can be transformed into a behaviourally equivalent CP-net. This allows us to deduce properties of CP-nets with channels from well-known properties of CP-nets. As an example, we extend the concept of place invariants to cope with CP-nets with channels and show how place invariants can be found. This is done without transforming the CP-nets with channels into their equivalent CP-nets. The reader is assumed to be familiar with th...
Modular State Space Analysis of Coloured Petri Nets
- IN PROC. OF THE 16 TH INTERNATIONAL CONFERENCE ON APPLICATION AND THEORY OF PETRI NETS
, 1995
"... State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem of state space analysis is the size of the state spaces. Several ways to reduce it have been proposed but cannot yet handle industrial size systems. Large models ..."
Abstract
-
Cited by 26 (3 self)
- Add to MetaCart
State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem of state space analysis is the size of the state spaces. Several ways to reduce it have been proposed but cannot yet handle industrial size systems. Large models
The Object Orientation of Object Petri Nets
- PROCEEDINGS OF WORKSHOP ON OBJECT ORIENTED PROGRAMMING AND MODELS OF CONCURRENCY
, 1995
"... This paper informally introduces Object Petri Nets (OPNs) with a number of examples and discusses how this kind of Petri Net addresses a number of issues pertinent to Concurrent Object-Oriented Programming Languages. OPNs support a thorough integration of object-oriented concepts into Petri Nets, ..."
Abstract
-
Cited by 14 (2 self)
- Add to MetaCart
This paper informally introduces Object Petri Nets (OPNs) with a number of examples and discusses how this kind of Petri Net addresses a number of issues pertinent to Concurrent Object-Oriented Programming Languages. OPNs support a thorough integration of object-oriented concepts into Petri Nets, including inheritance and the associated polymorphism and dynamic binding. They have a single class hierarchy which includes both token types and subnet types, thereby allowing multiple levels of activity in the net. Yet OPNs retain the important property of being able to be transformed into behaviourally equivalent Coloured Petri Nets (CPNs), which can provide a foundation for adapting existing analysis techniques such as invariant analysis.
C.: Particle Petri nets for aircraft procedure monitoring under uncertainty
- In 26thInternational Conference onApplicationand Theory of Petri Nets and Other Models of Concurrency (ATPN
, 2005
"... Abstract. In the framework of the study and analysis of new flight procedures, we propose a new Petri net-based formalism to represent both continuous and discrete evolutions and uncertainties: the particle Petri net. This model is based on a particle filtering-like representation of the probabilist ..."
Abstract
-
Cited by 13 (5 self)
- Add to MetaCart
(Show Context)
Abstract. In the framework of the study and analysis of new flight procedures, we propose a new Petri net-based formalism to represent both continuous and discrete evolutions and uncertainties: the particle Petri net. This model is based on a particle filtering-like representation of the probabilistic uncertainty on the continuous part of the procedure, and a possibilistic Petri net-inspired approach to deal with the uncertainty on events. After introducing this formalism, we propose an analysis of an approach procedure, and a further application to the on-line tracking of pilots ’ activities. 1
Some Decidability Results for Nested Petri Nets
- Proc. of 3rd Perspectives of System Informatics
, 2000
"... . Nested Petri nets are Petri nets using other Petri nets as tokens, thereby allowing easy description of hierarchical systems. Their nested structure make some important verication problems undecidable (reachability, boundedness, . . . ) while some other problems remain decidable (termination, inev ..."
Abstract
-
Cited by 12 (1 self)
- Add to MetaCart
. Nested Petri nets are Petri nets using other Petri nets as tokens, thereby allowing easy description of hierarchical systems. Their nested structure make some important verication problems undecidable (reachability, boundedness, . . . ) while some other problems remain decidable (termination, inevitability, . . . ). 1 Introduction For modelling and analysis distributed concurrent systems, there exists a large variety of formalisms based on Petri nets [Rei85,Jen92,Smi96,Lom97]. Among them, several approaches extend the Petri nets formalism by notions and structures inspired from object oriented programming [Sib94,Lak95,MW97,Val98]. Such extensions are helpful for modelling hierarchical multi-agent distributed systems. While Sibertin-Blanc [Sib94], Lakos [Lak95], Moldt and Wienberg [MW97] consider systems with communicating coloured Petri nets, Valk [Val98] in his object Petri nets considers tokens as objects with a net structure. In his approach, the system net and object nets are ...
From team plan to individual plans: a Petri net-based approach
- In AAMAS’05
"... This paper focuses on a framework for representing a team plan and its projections on individual agents. The team plan is represented with a coloured Petri net. Using the implicit place reduction rule an agenticity hierarchy is deduced: each transition bearing two or more output places corresponds t ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
(Show Context)
This paper focuses on a framework for representing a team plan and its projections on individual agents. The team plan is represented with a coloured Petri net. Using the implicit place reduction rule an agenticity hierarchy is deduced: each transition bearing two or more output places corresponds to splitting the (sub)team into (sub)subteams; a two-input-place transition merges subteams. The reduction rule is extended to support the notion of transfer of an agent from one subteam to another. These notions of splitting, merging and transfer are basic team management structures which describe the dynamic team hierarchical organisation. At each level of agenticity a plan is derived from the team plan reduction. Controlling an agent individually requires extracting individual information, such as activities involving the agent as well as interacting agents or subteams at each level of agenticity. The agent-projected plan encompasses for each level of agenticity an activity plan and a list of cooperating agents or subteams.
Object Oriented Modelling with Object Petri Nets
- In: Advances in Petri Nets. LNCS
, 1997
"... : This paper informally introduces Object Petri Nets (OPNs) with a number of examples. OPNs support a thorough integration of object-oriented concepts into Petri Nets, including inheritance and the associated polymorphism and dynamic binding. They have a single class hierarchy which includes both to ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
(Show Context)
: This paper informally introduces Object Petri Nets (OPNs) with a number of examples. OPNs support a thorough integration of object-oriented concepts into Petri Nets, including inheritance and the associated polymorphism and dynamic binding. They have a single class hierarchy which includes both token types and subnet types, thereby allowing multiple levels of activity in the net. The paper discusses some theoretical issues pertinent to the definition of OPNs, and compares the provisions of OPNs with those of other Concurrent Object-Oriented Programming Languages. The paper then considers a case study of using OPNs to model a cooperative editor for hierarchical diagrams. This extended example demonstrates the applicability of OPNs to the modelling of non-trivial concurrent systems. The methodology for deriving a Petri Net model is to adapt an object-oriented design methodology: the Object Model is prepared in Rumbaugh's OMT notation; the Dynamic Model is then prepared in the form of l...
Parameterised Coloured Petri Nets
, 1999
"... In this paper we examine Coloured Petri Nets extended with parameters. We characterise three kinds of parameterisation and formally define Parameterised Coloured Petri Nets. We then discuss how parameterised Coloured Petri Nets can be used to create libraries of Coloured Petri Nets modules in the sa ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
In this paper we examine Coloured Petri Nets extended with parameters. We characterise three kinds of parameterisation and formally define Parameterised Coloured Petri Nets. We then discuss how parameterised Coloured Petri Nets can be used to create libraries of Coloured Petri Nets modules in the same way as libraries for programming languages. Finally we discuss how to implement a simple simulator for such modules.
