Abstract
Properties of concurrent systems like deadlock-avoidance, fairness etc. can be achieved by appropriate controls of the external behaviour in many cases. The paper investigates the problem in which way such controls can be realized by restrictions of the internal state behaviour of the systems.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arnold,A., M.Nivat: Controlling behaviours of systems, some basic concepts and some applications. In: P.Dembiński, Ed., Mathematical Foundations of Computer Science (LNCS 88, 1980), 113–122.
Burkhard, H.D.: Control of Petri nets by finite automata. Fundamenta Informaticae VI.2 (1983), 185–215.
Burkhard,H.D.: (1) An investigation of controls for concurrent systems based on abstract control languages. To appear in Theoretical Computer Science.
Burkhard, H.D.: (2) Extended abstract: An investigation of controls for concurrent systems by abstract control languages. In: M.P.Chytil and V.Koubek, Ed., Mathematical Foundations of Computer Science (LNCS 176, 1984), 223–231.
Burkhard,H.D.: (3) Extended german version: Untersuchung von Steuerproblemen nebenläufiger Systeme auf der Basis abstrakter Steuersprachen. Seminarbericht Nr. 58, Sektion Mathematik, Humboldt-Universität zu Berlin, 1984.
Carstensen,H., R.Valk: Infinite behaviour and fairness in Petri nets. Proc. 4th European Workshop on Application and Theory of Petri Nets, Toulouse 1983, 104–123.
Lehmann,D., A.Pnueli, J.Stavi: Impartiality, justice, fairness: The ethics of concurrent termination. In: S.Even and O.Kariv, Ed., Automata, Languages and Programming (LNCS 115, 1981), 264–277.
Sifakis, J.: A unified approach for studying the properties of transition systems. Theoretical Computer Science 18 (1982), 1–32.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burkhard, HD. (1985). On the control of concurrent systems by restrictions of the state behaviour. In: Skowron, A. (eds) Computation Theory. SCT 1984. Lecture Notes in Computer Science, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16066-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-16066-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16066-3
Online ISBN: 978-3-540-39748-9
eBook Packages: Springer Book Archive