This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Best. Fairness and conspiracies. Information Processing Letters, 18:215–220, 1984. Addendum, Vol. 19, page 162, 1984.
G. Brams. Reseaux de Petri: Theorie et Pratique — Tome 1: Theorie et Analyse. Masson, Paris, 1983.
H. Carstensen. Decidability questions for fairness in Petri nets. In Proceedings of the 4th Symposium on Theoretical Aspects of Computer Science, pages 396–407, 1987. LNCS 247.
H. Carstensen and R. Valk. Infinite behaviour and fairness in Petri nets. In Advances in Petri Nets 1984, pages 83–100, Springer-Verlag, 1985. LNCS 188.
A. Chandra. Computable nondeterministic functions. In Proceedings of the 19th IEEE Symposium on the Foundations of Computer Science, pages 127–131, 1978.
D. Escrig. A collection of algorithms to decide liveness and other related properties of a place transition system. Unpublished manuscript.
N. Francez. Fairness. Springer-Verlag, 1986.
R. Howell and L. Rosier. On questions of fairness and temporal logic for conflict-free Petri nets. In Proceedings of the 8th European Workshop on Applications and Theory of Petri Nets, pages 197–214, 1987.
R. Howell, L. Rosier, D. Huynh, and H. Yen. Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states. Theoret. Comp. Sci., 46:107–140, 1986.
R. Howell, L. Rosier, and H. Yen. A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. Technical Report 88-03, Department of Computer Sciences, The University of Texas at Austin, Austin, Texas 78712, 1988.
R. Kosaraju. Decidability of reachability in vector addition systems. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pages 267–280, 1982.
L. Landweber. Decision problems for ω-automata. Math. Syst. Theory, 3:376–384, 1969.
D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness: the ethics of concurrent termination. In Proceedings of the 8th International Colloquium on Automata, Languages, and Programming, pages 264–277, 1981. LNCS 115.
R. Lipton. The Reachability Problem Requires Exponential Space. Technical Report 62, Yale University, Dept. of CS., Jan. 1976.
E. Mayr. An algorithm for the general Petri net reachability problem. SIAM J. Comput., 13(3):441–460, 1984. A preliminary version of this paper was presented at the 13th Annual Symposium on Theory of Computing, 1981.
H. Müller. The reachability problem for VAS. In Advances in Petri Nets, pages 376–391, Springer-Verlag, 1985. LNCS 188.
J. Peterson. Petri Net Theory and the Modeling of Systems. Prentice Hall, Englewood Cliffs, NJ, 1981.
J. Queille and J. Sifakis. Fairness and related properties in transition systems — a temporal logic to deal with fairness. Acta Informatica, 19:195–220, 1983.
C. Rackoff. The covering and boundedness problems for vector addition systems. Theoret. Comp. Sci., 6:223–231, 1978.
L. Rosier and H. Yen. A multiparameter analysis of the boundedness problem for vector addition systems. J. of Computer and System Sciences, 32(1):105–135, 1986.
R. Valk and M. Jantzen. The residue of vector sets with applications to decidability problems in Petri nets. Acta Informatica, 21:643–674, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Howell, R.R., Rosier, L.E., Yen, HC. (1988). A taxonomy of fairness and temporal logic problems for petri nets. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017158
Download citation
DOI: https://doi.org/10.1007/BFb0017158
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50110-7
Online ISBN: 978-3-540-45926-2
eBook Packages: Springer Book Archive