On the complexity of deciding fair termination of probabilistic concurrent finite-state programs

Authors:
L. E. Rosier;H. C. Yen
Affiliations:
-;-
Venue:
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Year:
1988

Citing 0
Cited 2

Quantitative Analysis under Fairness Constraints

ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
On Almost-Sure Properties of Probabilistic Discrete Event Systems

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday

Quantified Score

Hi-index	0.00

Visualization

Abstract