Frozen tokens and D-continuity: A study in relating system properties to process properties

  • Eike Best
  • Agathe Merceron
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 188)


This paper is based on the notion that there is a formal relationship between a system and the set of its processes. Both the system and its processes are described in terms of Petri nets. We prove a theorem which gives a correspondence between a property of the processes called D-continuity and a set of properties of the system. D-continuity has first been introduced as a generalisation of the Dedekind completeness properties of the real numbers. Our main result shows that a system has only D-continuous processes iff it is safe (in the sense that its capacities are finite), behaviourally connected (in the sense that its infinite processes use all parts of the system) and satisfies another (minor) property.


Firing Sequence Infinite Line Finite Approximation Infinite Process Infinite Execution 
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. 1.
    E. Best: A Theorem on the Characteristics of Non-sequential Processes. Fundamenta Informaticae Vol. 3(1), 77–94 (1980).Google Scholar
  2. 2.
    E.Best: The Relative Strength of K-density. In [6].Google Scholar
  3. 3.
    E.Best: Concurrent Behaviour: Sequences, Processes and Axioms. Arbeitspapiere der GMD No.118 (1984), also in Proc. of CMU Workshop on Concurrency (1984).Google Scholar
  4. 4.
    E.Best and A.Merceron: Concurrency Axioms and D-continuous Posets. In this Volume.Google Scholar
  5. 5.
    G.W.Brams: Réseaux de Petri: Théorie & Pratique, Masson-Paris (1982).Google Scholar
  6. 6.
    W.Brauer (ed.): Net Theory and Applications. denotes Springer Lecture Notes in Computer Science Vol.84 (1980).Google Scholar
  7. 7.
    C. Fernández and P.S. Thiagarajan: D-continuous Causal Nets: A Model of Non-sequential Processes. TCS Vol.28, 171–196 (1984).Google Scholar
  8. 8.
    H.J. Genrich and P.S. Thiagarajan: A Theory of Bipolar Synchronisation Schemes. TCS Vol.30, 241–318 (1984).Google Scholar
  9. 9.
    U. Goltz and W. Reisig: The Non-sequential Behaviour of Place/Transition Nets. Information and Control, Vol.57 (2–3), 125–147 (1983).CrossRefGoogle Scholar
  10. 10.
    A. Merceron: A Study of some Dependencies between a Concurrent System and its Processes, applied to Petri Nets. 1st International Conference on Computers and Applications, Bei-Jing (Peking) (1984).Google Scholar
  11. 11.
    W.M.Lu and A.Merceron: On the Meaning of Frozen Tokens. Report in preparation.Google Scholar
  12. 12.
    M.W.Lu and A.Merceron: The Equivalence between the Well Behaved Bipolar Schemes and the Live and Safe Free Choice Nets without Frozen Tokens. 5th Petri Net Workshop, Århus (1984).Google Scholar
  13. 13.
    C.A.Petri: Non-sequential Processes. GMD-ISF Report 77.05 (1977).Google Scholar
  14. 14.
    C.A.Petri: Concurrency. In [6]. Also: C.A. Petri: State/Transition Structures in Physics and in Computation. Int. Journal on Theoretical Physics, Vol.21(12), 979–992 (1982).Google Scholar
  15. 15.
    W.Reisig: Petrinetze. Springer Verlag (1982).Google Scholar
  16. 16.
    M.W.Shields: Some Theorems on Adequacy-Preserving Substitutions. ASM/51, Computing Laboratory, University of Newcastle upon Tyne (1978).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Eike Best
    • 1
  • Agathe Merceron
    • 2
  1. 1.GMD-F1P Schloß BirlinghovenSt. Augustin 1Fed. Rep. Germany
  2. 2.L.R.I., CNRS Université Paris-SudOrsay CedexFrance

Personalised recommendations