1983
DOI: 10.1016/0022-0000(83)90029-6
|View full text |Cite
|
Sign up to set email alerts
|

A method for stepwise refinement and abstraction of Petri nets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
84
0
1

Year Published

1991
1991
2012
2012

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 245 publications
(85 citation statements)
references
References 6 publications
0
84
0
1
Order By: Relevance
“…The synthesis and reduction methodologies can be described as: i) top-down, ii) bottom-up and iii) hybrid. The top-down approach starts with a high level model of the system under consideration and then adds stepwise refinements until the desired level of detail is achieved in the model [17][19] [20]. The bottom-up approach also referred to as a reduction approach consists of joining Petri net sub-models that share places or transitions.…”
Section: Introduction To Synthesis and Reduction Methods For Petri Netsmentioning
confidence: 99%
“…The synthesis and reduction methodologies can be described as: i) top-down, ii) bottom-up and iii) hybrid. The top-down approach starts with a high level model of the system under consideration and then adds stepwise refinements until the desired level of detail is achieved in the model [17][19] [20]. The bottom-up approach also referred to as a reduction approach consists of joining Petri net sub-models that share places or transitions.…”
Section: Introduction To Synthesis and Reduction Methods For Petri Netsmentioning
confidence: 99%
“…In the RA model, the transitions t 1 , t 3 , t 4 , t 6 , t 8 , t 10 , t 11 and t 12 represent logical conditions, being estimated 1 t.u. per transition.…”
Section: Quantitative Analysismentioning
confidence: 99%
“…The formal validation of the large model requires the analysis of the sub-Petri nets and the application of the theorems established by [9] and latter generalised by [10] about the preservation of boundedness and liveness properties. This theorem points out that using stepwise refinement it is not necessary to perform the analysis of the detailed and large Petri net, because all of its properties can be deduced from the analysis of the initial Petri net and each one of the sub Petri nets.…”
Section: B Validation Of the Behavioural Sub-modelsmentioning
confidence: 99%
“…However, these works focus on "horizontal" modularization (i.e., composition) of communicating systems, while we are interested here in "vertical" modularization (i.e., refinement). Conditions for vertical modularization were given by [28,12], regarding soundness-preserving refinements of a single place (in a Petri net).…”
Section: Introductionmentioning
confidence: 99%