research-article

Open access

Partial order behaviour and structure of Petri nets

Authors:

Jörg DeselAuthors Info & Claims

Formal Aspects of Computing, Volume 2, Issue 1

Pages 123 - 138

https://doi.org/10.1007/BF01888220

Published: 01 March 1990 Publication History

Abstract

This paper argues that partial order semantics can be used profitably in the proofs of some nontrivial results in Petri net theory. We show that most of Commoner's and Hack's structure theory of free choice nets can be phrased and proved in terms of partial order behaviour. The new proofs are considerably shorter (and, arguably, more lucid) than the old ones; they also generalise the results from (safe) free choice nets to (bounded) extended free choice nets.

References

References

[1]

Best E. and Devillers R. Sequential and Concurrent Behaviour in Petri Net Theory TCS. 1987 55 1 87-136

Digital Library

[2]

Best, E. and Fernández, C.:Nonsequential Processes. A Petri Net View. Springer Monographs on Theoretical Computer Science, Vol. 13, 1988.

[3]

Best, E. and Thiagarajan, P. S.: Some Classes of Live and Safe Petri Nets. InConcurrency and Nets, K. Voss, H. J. Genrich and G. Rozenberg (eds), pp. 71–94, Springer-Verlag, 1987.

[4]

Commoner, F.: Deadlocks in Petri Nets. Report, Applied Data Inc., CA-7206-2311 (1972).

[5]

Desel, J.: Synchronie-Abstand in Stellen/Transitionen-Systemen. Diplomarbeit Arbeitspapiere der GMD Nr. 341, 1988.

[6]

Döpp K. Zum Hack'schen Wohlformungssatz für Free-Choice-Petrinetze EIK 1983 19 1–2 3-15

[7]

Esparza, J. and Silva, M.: Circuits, Handles, Bridges and Nets,10th Int. Conf. on Applications and Theory of Petri Nets, Bonn, pp. 134–153, 1989.

[8]

Goltz, U. and Reisig, W.: Weighted Synchronie Distances. InInformatik-Fachberichte 52: Application and Theory of Petri Nets, pp. 289–300, Springer-Verlag, 1982.

[9]

Goltz U. and Reisig W. The Non-Sequential Behaviour of Petri Nets Information and Control 1983 57 2–3 125-147

[10]

Hack, M.:Analysis of Production Schemata by Petri Nets. TR-94, MIT-MAC, 1972.

[11]

Hack, M.:Corrections to MAC-TR-94. Computation Structure Notes 17, MIT-MAC, 1974.

[12]

Lu, W. M. and Merceron, A.: The Equivalence Between Well-behaved Bipolar Sychronisation Schemes and the Live and Safe Free Choice Nets Without Frozen Tokens,5th European Workshop on Application and Theory of Petri Nets, Århus, pp. 216–232, 1984.

[13]

Memmi, G. and Roucairol, G.:Linear Algebra in Net Theory. LNCS 84, pp. 213–220, Springer-Verlag, 1980.

[14]

Pratt V. Modelling of Concurrency with Partial Orders Int. Journal of Parallel Processing 1986 15 1 33-71

Digital Library

[15]

Thiagarajan P. S. and Voss K. A Fresh Look at Free Choice Nets Information and Control 1984 61 2 85-113

Cited By

Polyvyanyy ALa Rosa MOuyang Cter Hofstede A(2015)Untanglings: a novel approach to analyzing concurrent systemsFormal Aspects of Computing10.1007/s00165-014-0329-427:5-6(753-788)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1007/s00165-014-0329-4
Narayanan SMcIlraith SLassner DDe Roure DIyengar A(2002)Simulation, verification and automated composition of web servicesProceedings of the 11th international conference on World Wide Web10.1145/511446.511457(77-88)Online publication date: 7-May-2002
https://dl.acm.org/doi/10.1145/511446.511457
Best ECherkasova LDesel J(1992)Compositional generation of home states in free choice netsFormal Aspects of Computing10.1007/BF012114754:6(572-581)Online publication date: 1-Nov-1992
https://dl.acm.org/doi/10.1007/BF01211475

Index Terms

Partial order behaviour and structure of Petri nets
1. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Software system models
        Petri nets
2. Theory of computation

Index terms have been assigned to the content through auto-classification.

Recommendations

Non Equivalence between Time Petri Nets and Time Stream Petri Nets
PNPM '99: Proceedings of the The 8th International Workshop on Petri Nets and Performance Models

It had been shown that Merlin's Time Petri Nets are a special case of Time Stream Petri Nets. In this paper, we show that it does not exist a time equivalence between both models. We extend first this result to the nonequivalence of Timed Automata and ...
From Petri Nets to colored Petri Nets: a tutorial introduction to nets based formalism for modeling and simulation
WSC '19: Proceedings of the Winter Simulation Conference

Petri Net, a widely studied mathematical formalism, is a graphical notation for modeling systems. Petri Nets provide the foundation for modeling concurrency, communication, synchronization, and resource sharing constraints that are inherent to many ...
Time and Petri Nets

Comments

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing

Formal Aspects of Computing Volume 2, Issue 1

Mar 1990

395 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

© BCS 1990.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 March 1990

Accepted: 15 December 1989

Received: 15 March 1989

Published in FAC Volume 2, Issue 1

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
54
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)13

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Polyvyanyy ALa Rosa MOuyang Cter Hofstede A(2015)Untanglings: a novel approach to analyzing concurrent systemsFormal Aspects of Computing10.1007/s00165-014-0329-427:5-6(753-788)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1007/s00165-014-0329-4
Narayanan SMcIlraith SLassner DDe Roure DIyengar A(2002)Simulation, verification and automated composition of web servicesProceedings of the 11th international conference on World Wide Web10.1145/511446.511457(77-88)Online publication date: 7-May-2002
https://dl.acm.org/doi/10.1145/511446.511457
Best ECherkasova LDesel J(1992)Compositional generation of home states in free choice netsFormal Aspects of Computing10.1007/BF012114754:6(572-581)Online publication date: 1-Nov-1992
https://dl.acm.org/doi/10.1007/BF01211475

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents