2005
DOI: 10.1080/17442500512331341040
|View full text |Cite
|
Sign up to set email alerts
|

Piecewise deterministic Markov processes represented by dynamically coloured Petri nets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2006
2006
2019
2019

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 35 publications
(25 citation statements)
references
References 11 publications
0
22
0
Order By: Relevance
“…In this paper, one way to avoid this problem is investigated. The idea is to represent the interconnection of the recovery logic and linear system using a type of Petri net called a Dynamically Colored Petri Net (DCPN) [4]. A Petri net (cf.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, one way to avoid this problem is investigated. The idea is to represent the interconnection of the recovery logic and linear system using a type of Petri net called a Dynamically Colored Petri Net (DCPN) [4]. A Petri net (cf.…”
Section: Introductionmentioning
confidence: 99%
“…In using the (S)DCPN formalism [26], [27], [28] in modelling more and more complex multi-agent hybrid systems, it was found that the compositional specification power of Petri nets reaches its limitations. More specifically, the following problems were identified:…”
Section: Specification Of Petri Net Modelmentioning
confidence: 99%
“…In [36], [42] a colour does not change as long as the token to which it is attached remains at its place. Everdij and Blom [26], [27] defined a Dynamically Coloured Petri Net (DCPN) by incorporating the following extensions: (1) a colour assumes values from a Euclidean state space, its value evolves as solution of a differential equation and influences the time period between enabling and firing; (2) the new tokens and attached colours are produced as random functions of the removed tokens and colours. An SDCPN extends an DCPN in the sense that colours evolve as solutions of a stochastic differential equation [28].…”
Section: Development Of MC Simulation Modelmentioning
confidence: 99%
“…We alsoa pply thea lgorithmo fS ection 4t os howt hatt his value-passing CPDP can be converted to aPDP.The ATM-examplew as first modelled as aD ynamically Coloured Petri Net (DCPN) (see the chaptera t pp. 325-350 of this book).DCPN is aPetri net formalism, whichhas alsobeen designed forc ompositional specification of PDP-type systems (see [6]a nd [7] fort he DCPN model).…”
Section: Communicatingp Iecewise Deterministic Markov Processesmentioning
confidence: 99%