Lecture Notes in Computer Science
DOI: 10.1007/bfb0022467
|View full text |Cite
|
Sign up to set email alerts
|

The analysis of distributed systems by means of predicate/transition-nets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
22
0
2

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 84 publications
(24 citation statements)
references
References 1 publication
0
22
0
2
Order By: Relevance
“…While they are close to the general PrT model they are particularly tailored to modeling and analyzing distributed administrative procedures subject to constraints as specified through predicate logic formulas. Like for PrT Nets automated formal analysis tools can be implemented, based either on reachability analysis (such as for real-time Petri Nets that work well for nets with thousands of transactions) or on (algebraic) invariant methods [Genrich and Lautenbach 1979]. The latter operate on the net level for automatically checking fairness properties and others.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…While they are close to the general PrT model they are particularly tailored to modeling and analyzing distributed administrative procedures subject to constraints as specified through predicate logic formulas. Like for PrT Nets automated formal analysis tools can be implemented, based either on reachability analysis (such as for real-time Petri Nets that work well for nets with thousands of transactions) or on (algebraic) invariant methods [Genrich and Lautenbach 1979]. The latter operate on the net level for automatically checking fairness properties and others.…”
Section: Related Workmentioning
confidence: 99%
“…In a particular effort to obtain a general high-level tool, Predicate/Transition Nets (PrTNets) had been defined by Genrich and Lautenbach [1979], including ideas for a thorough algebraic analysis of such nets. There was a precursor model studied by Schiffers and Wedde, which is called Colored Petri Nets (CP-Nets) [Schiffers and Wedde 1978].…”
Section: Related Workmentioning
confidence: 99%
“…Research was done to raise the level of abstraction of Petri Nets. Genrich and Lautenbach [1979] developed Predicate Transition Nets which extended the range of application of the Petri Net construct. Predicate Transition Nets also maintain a close relationship to lower level nets.…”
Section: Executable Modeling Languagesmentioning
confidence: 99%
“…One such analysis is the identification of invariants of the graph. Farkas [1902], Genrich and Lautenbach [1979] and Hillion [1986] offer algorithms for identifying the invariants of a PN graph. This methodology uses the Farkas algorithm and concepts developed by Hillion to analyze the graphs that represent the executable models created by this methodology.…”
Section: Executable Modeling Languagesmentioning
confidence: 99%
“…There is a large quantity of literature available on Petri nets with individual tokens. Different variants have evolved, namely colored Petri nets [4], [5], algebraic highlevel nets [6] and Predicate/Transition nets [7].…”
Section: Introductionmentioning
confidence: 99%