Decidability Questions for Fairness in Petri Nets

@inproceedings{Carstensen1987DecidabilityQF,
  title={Decidability Questions for Fairness in Petri Nets},
  author={Heino Carstensen},
  booktitle={STACS},
  year={1987}
}
The infinite behaviour of Petri nets, especially the fair behaviour, is investigated. Fairness of concurrent systems includes two different approaches. One may give criteria for a modelled problem under which the Petri net behaves fair. E. g. certain actions must appear again and again in every sequence, but it is not said how this can be achieved. The other approach gives criteria for a fair execution of the net, i. e. the selection of concurrently enabled transitions is done in a fair manner… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-6 of 6 references

R

H. Carstensen
Valk: Inf ini te Behaviour and Fairness in Pe tr i Nets; In G. Rozenberg (ed.): Advances in Pe tr i Ne t s 198~; Lecture Notes in Computer Science 188, (S. 83 - 100), Springer, Berlin • 1985
View 1 Excerpt

Brams: R~seauz de Petri: Thdorie et Pratique - - Tome 1: thdorie et analyse

G W.
1983

Minsky: Computation: Finite and Infinite Machines

M L.
1967

Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors

L. E. Dickson
American Journal of Mathematics 35, (S • 1913

Similar Papers

Loading similar papers…