On the control of concurrent systems by restrictions of the state behaviour

  • Hans-Dieter Burkhard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 208)


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.


Transition System Concurrent System External Behaviour Reachability Graph Control Principle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /AN/.
    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.Google Scholar
  2. /Bu83/.
    Burkhard, H.D.: Control of Petri nets by finite automata. Fundamenta Informaticae VI.2 (1983), 185–215.Google Scholar
  3. /Bu84/.
    Burkhard,H.D.: (1) An investigation of controls for concurrent systems based on abstract control languages. To appear in Theoretical Computer Science.Google Scholar
  4. /Bu84/.
    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.Google Scholar
  5. /Bu84/.
    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.Google Scholar
  6. /CV/.
    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.Google Scholar
  7. /LPS/.
    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.Google Scholar
  8. /S/.
    Sifakis, J.: A unified approach for studying the properties of transition systems. Theoretical Computer Science 18 (1982), 1–32.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Hans-Dieter Burkhard
    • 1
  1. 1.Sektion MathematikHumboldt-UniversitätBerlin

Personalised recommendations