Abstract
We give a semantics for place/transition nets, which describes the input/out-put behaviour using fixed point techniques. The semantics is shown to be compositional w.r.t. the net operators parallel composition, feedback and output merging. We prove consistency with the step sequence semantics and thus give an equivalent operational semantics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Best, E., Devillers, R., Hall, J.G.: The box calculus: a new causal algebra with multi-label communcation. In: Rozenberg, G. (ed.) Advances in Petri Nets 1992, LNCS 609, Springer (1992), pp. 21–69
Brauer, W., Gold, R.: Concurrent processes and Petri nets. To appear in: Schwichtenberg, H. (ed.), Proof and computation, NATO ASI Series F, Springer (1994)
Brauer, W., Reisig, W., Rozenberg, G. (eds.): Petri nets: central models and their properties. LNCS 254, Springer (1987)
Brock, J.D., Ackerman, W.B.: Scenarios: A model of non-determinate computation. In: Diaz, J.; Ramos, I. (eds.) Proc. of the International Colloquium on Formalization of Programming Concepts, Peniscola 1981, LNCS 107, Springer (1981), pp. 252–259
Broy, M.: Nondeterministic data flow programs: how to avoid the merge anomaly. Science of Computer Programming 10, pp. 65–85 (1988)
Broy, M., Streicher, T.: Modular functional modelling of Petri nets with individual tokens. In: Rozenberg, G. (ed.) Advances in Petri Nets 1992, LNCS 609, Springer (1992), pp. 70–88
Gold, R.: Datenflußsemantiken für Petrinetze. TU München, Fakultät für Informatik, Dissertation (1993)
Gunter, C.A., Scott, D.S.: Semantic domains. In: van Leeuwen, J. (ed.) Formal Models and Semantics, Handbook of Theoretical Computer Science, Volume B, Elsevier (1990), pp. 633–674
Hitchcock, P., Park, D.: Induction rules and termination proofs. In: Nivat, M. (ed.) Proc. of the Symposium on Automata, Languages and Programming, North-Holland (1972), pp. 225–251
Jonsson, B.: A fully abstract trace model for dataflow networks. In: Proc. of the 16th Annual ACM Symposium on Principles of Programming Languages, Austin 1989 (1989), pp. 155–165
Kahn, G.: A preliminary theory for parallel programs. IRIA Rapport de Recherche 6 (1973)
Keller, R.M.: Denotational models for parallel programs with indeterminate operators. In: Neuhold, E.J. (ed.) Formal Description of Programming Concepts, North-Holland (1978), pp. 337–366
Kok, J.N.: A fully abstract semantics for data flow nets. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE '87, Proc. of the Conference on Parallel Architectures and Languages Europe, Volume II: Parallel Languages, Eindhoven 1987, LNCS 259, Springer (1987), pp. 351–368
Misra, J.: Equational reasoning about nondeterministic processes. Formal Aspects of Computing 2, pp. 167–195 (1990)
Reisig, W.: On solving conflicts in Petri nets. In: Pape, U. (ed.) Discrete Structures and Algorithms, Hanser (1980), pp. 241–253
Reisig, W.: Petri nets. Springer (1985)
Taubner, D.: On the implementation of Petri nets. In: Rozenberg, G. (ed.) Advances in Petri Nets 1988, LNCS 340, Springer (1988), pp. 418–439
Vogler, W.: Failures semantics and deadlocking of modular Petri nets. Acta Informatica 26, pp. 333–348 (1989)
Author information
Authors and Affiliations
Additional information
This work was partially supported by the Deutsche Forschungsgemeinschaft, SFB 342
Rights and permissions
About this article
Cite this article
Gold, R. A compositional dataflow semantics for Petri nets. Acta Informatica 32, 627–645 (1995). https://doi.org/10.1007/BF01186644
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01186644