Abstract
We propose a constructive approach for the specification of distributed systems that allows for a detailed analysis of essential invariance properties like liveness or determinism. A meta-language is defined for the specification of interaction-schemes among processes, each assuring some specific invariance properties. An operational Petri-net semantics, defined for these constructs, allows for an algebraical analysis of invariance properties. The results may be reflected to the process-system and help to identify design errors in the communication and synchronization structure of a distributed system.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baker, H.G.; Rabin's proof of the undecidability of the reachability set inclusion problem of vector addition systems; Computation Structures Group Memo 1979; Project MAC; M.I.T. July 1973
Barringer, H.; A survey of verification techniques for parallel programs; LNCS 191, Springer 1986
Brookes, S.D.; Hoare, C.A.R.; Roscoe, A.W.; A theory of communicating sequential processes; Jour. of the ACM, 1984, Vol. 31, pp. 560–599
Broy, M.; Bauer, F.L.; A systematic approach to language constructs for concurrent programs; Science of Computer Programming, 4, 1984, pp. 103–139 North Holland
Esparza, J.; Silva, M.; A polynomial-time algorithm to decide liveness of bounded free-choice nets; Internal Report, June 1989
Genrich, H.J.; Lautenbach, K.; The analysis of distributed systems by means of Predicate/Transition nets; in Semantics on concurrent computation LNCS 70; Springer 1979
Genrich, H.J.; Lautenbach, K.; Thiagarajan, P.S.; Elements of general net theory, in Net theory and applications (ed. W. Bauer), pp. 21–164; LNCS 84; Springer 1980
Hack, M.; The recursive equivalence of the reachability problem and the liveness problem for Pelri nets and vector addition systems; Proc. 15th Ann. Symp. Switching and Automata, IEEE, 1974
Hack, M.; Decidability questions for petri nets; MIT Technical Report 161, June 1976
Jensen, K.; How to find invariants for coloured Petri nets; LNCS 118, Springer, 1981, pp. 327–338
Jensen, K.; Coloured Petri-nets; Advances in Petri Nets, Part I, LNCS 254, Springer 1986
Karp, R.M.; Miller, R.E.; Properties of a model for parallel computations: Determinacy, Termination, Queueing; SIAM, Vol. 14, No. 6, 1966, pp. 1390–1411
Landweber, L.; Robertson, E.; Properties of conflict-free and persistent Petri-nets; Journal of the ACM, Vol. 25, Nr. 3, 1978, pp. 352–364
Millier, R.; A Calculus of Communicating Systems; LNCS 92, Springer 1980
Murata, T.; Petri nets: properties, analysis and applications; Proc. of the IEEE, Vol. 77, No.4, 1989
Olderog, E.R.; Process theory: semantics, specification and verification; LNCS 224, pp. 442–509, Springer, 1986
Pantke, S.; Semantische Analyse von GRAPH Prozeβsystemen; Master Thesis, Univ. of Kiel, 1990
Peterson, J.L.; Petri Nets; ACM Computing Surveys, 1977, Vol. 9, No. 3
Reisig, W.; Petrinetze; Springer 1986
Sacerdote, G.; Tenney, R.L.; The decidability of the reachability problem for vector addition systems; 1976
Schepers, J.; GRAPH — Eine auf Petri-Netzen basierende Entwicklungsumgebung für verteilte Systeme; PhD Thesis, University of Kiel, 1990
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schepers, J. (1992). Invariance properties in distributed systems. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_409
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_409
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive