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
BETA

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

R

  • H. Carstensen
  • Valk: Inf ini te Behaviour and Fairness in Pe tr…
  • 1985
1 Excerpt

An Algorithm for the General Petri Net Reachability Problem

  • E. W. Mayr
  • SIAM J. Comput
  • 1984

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

Similar Papers

Loading similar papers…