Abstract
The notion of polynomial superfaimess, which is an extension of strong fairness, is introduced for Petri nets. Superfair sequences automatically have a lot of properties which are not implied by strong fairness. Nevertheless — under reasonable circumstances — almost all infinite occurrence sequences are superfair and there are recursive — in fact exponential — such sequences. The concept of superfaimess is compared to other fairness notions. Possible extensions are suggested.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Ambos-Spies, H. Fleischhack and H. Huwig: Diagonalizations over polynomial time computable sets, TCS 51(1987), 177–204.
K. Ambos-Spies, H. Heischhack and H. Huwig: Diagonalizations over Deterministic Polynomial Time, in “1st Workshop on Computer Sience Logic” (E. Börger, H. Kleine-Büning, M.M. Richter, Eds.), LNCS 329(1988), 1–16.
E. Best: Fairness and conspiracies, Inform. Process. Letters 18(1984), 215–220.
H. Carstensen: Fairness bei nebenläufigen Systemen, Techn Rep. 126(1987), Dept. Comp. Sci., Universität Hamburg.
H. Fleischhack: On diagonalizations over complexity classes, Techn Rep. 210(1985), Dept. Comp. Sci., Universität Dortmund.
H. Fleischhack: P-genericity and strong P-genericity, Proc. MFCS 1986, LNCS 233(1986), 341–349.
N. Francez: Fairness, Springer, Berlin (1986).
M. Kwiatkowska: Fairness for Non-Interleaving Concurrency (PhD Thesis), Technical Report No 22, University of Leicester, Leicester 1989.
A. Pnueli: On the extremely fair treatment of probabilistic algorithms, Proc. 15th ACM STOC, Boston MA(1983), 278–290.
E.-R. Olderog and K. Apt: Fairness in Parallel Programs: The Transformational Approach, Tech, Rep. 8611 (1986), Dept. Comp. Sci., Christian-Albrechts-Universität, Kiel.
R. Valk: Infinite Behavior and Fairness, in “Advanced Course on Petri Nets”, (W. Brauer, W. Reisig, G. Rozenberg, Eds.), LNCS 254,1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fleischhack, H. (1992). P-superfairness in nets. In: Jensen, K. (eds) Application and Theory of Petri Nets 1992. ICATPN 1992. Lecture Notes in Computer Science, vol 616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55676-1_11
Download citation
DOI: https://doi.org/10.1007/3-540-55676-1_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55676-3
Online ISBN: 978-3-540-47270-4
eBook Packages: Springer Book Archive