Abstract
The behaviour of the controlled system determines the control. This concise statement summarizes our approach to the investigation of controls. Using abstract languages to define behaviour and subbehaviour we are able to describe and to study different types of control rules and properties to be realized by control like deadlock avoidance, liveness and fairness.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Arnold, A., Nivat, M.: Controlling behaviours of systems, some basic concepts and some applications. LNCS 88 (1980), 113–122.
Apt, K.R., Pnueli, A., Stavi, J.: Fair termination revisited — with delay. Publ. du L.I.T.P., Univ. Paris VII, 82–51 (1982).
Best, E.: Relational semantics of concurrent programs (with some applications). Proc. IFIP TC-2 Conf. on Formal Descriptions of Programming Concepts, Garmisch-Partenkirchen 1982.
Budach, L.: Environments, Labyrinths and Automata. LNCS 56 (1977), 54–64.
Burkhard, H.D.: Ordered firing in Petri nets. EIK 17 (1981) 2/3, 71–86
Burkhard, H.D.: What gives Petri nets more computational power. Preprint 45, Sekt. Mathematik d. Humboldt-Univ. Berlin 1982.
Burkhard, H.D.: Control of Petri nets by finite automata. Fundamenta Informaticae VI.2 (1983), 185–215.
Burkhard, H.D.: On the control of concurrent systems with respect to fairness and liveness conditions. Intern. Summer School of the Progr. Language LOGLAN-82, Zaborów 1983.
Burkhard, H.D.: An investigation of controls for concurrent systems based on abstract control languages. Sekt. Mathe. d. Humboldt-Univ. Berlin 1984 (to appear as Preprint).
Burkhard, H.D.: Untersuchung von Steuerproblemen nebenläufiger Systeme auf der Basis abstrakter Steuersprachen. Sekt. Mathe. d. Humboldt-Univ. Berlin 1984 (to appear as Seminarbericht).
Burkhard, H.D., Starke, P.H.: A note on the impact of conflict resolution to liveness and deadlock in Petri nets. To appear in Fundamenta Informaticae.
Czaja, L.: Are infinite behaviours of parallel system schemata necessary? LNCS 148 (1983), 108–117.
Carstensen, H., Valk, R.: Infinite behaviour and fairness in Petri nets. Proc. 4th European Workshop on Application and Theory of Petri Nets, Toulouse 1983, 104–123.
Kosaraju, S.R.: Decidability of reachability in vector addition systems. Proc. 14th Ann. ACM Symp. on Theory of Computing 1982, 267–281.
Lehmann, D., Pnueli, A., Stavi, J.: Impartiality, justice, fairness: The ethics of concurrent termination. LNCS 115 (1981), 264–277.
Salwicki, A., Mueldner, T.: On the algorithmic properties of concurrent programs. LNCS 125 (1981), 169–197.
Valk, R., Jantzen, M.: The residue of vector sets with applications to decidability problems in Petri nets. Bericht IFI-HH-B-101/84, Fachbereich Informatik, Univ. Hamburg.
Valk, R., Vidal-Naquet, G.: Petri nets and regular languages. J. Comp. Syst. Sci. 23 (1981) 3, 299–325.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burkhard, H.D. (1984). An investigation of controls for concurrent systems by abstract control languages. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030302
Download citation
DOI: https://doi.org/10.1007/BFb0030302
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13372-8
Online ISBN: 978-3-540-38929-3
eBook Packages: Springer Book Archive