Reasoning About Probabilistic Behavior in Concurrent Systems

Authors:
S. Purushothaman;P. A. Subrahmanyam
Affiliations:
Pennsylvania State Univ., University Park;AT&T Bell Labs., Holmdel, NJ
Venue:
IEEE Transactions on Software Engineering
Year:
1987

Citing 0
Cited 3

Protocol verification using reachability analysis: the state space explosion problem and relief strategies

SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Testing preorders for probabilistic processes can be characterized by simulations

Theoretical Computer Science
Fully Abstract Characterization of Probabilistic May Testing

ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Certain aspects of the behavior of concurrent systems are intrinsically probabilistic in nature, e.g., the behavior of imperfect communication media used in network protocols. We address the problem of expressing such behavior in an algebraic calculus for communicating systems. The introduction of probabilistic information in the calculus alleviates the problem of proving liveness, as proving liveness now amounts to proving that its probability is 1. A methodology for proving both safety and liveness is developed and used in proving the correctness of the Alternating Bit Protocol.