Christel Baier
ABSTRACT
No abstract available.
- 1.BAIER, C., CLARKE, E., HARTONAS-OARMHAUSEN, V., KWIATKOWSKA, M., AND RYAN, M. Symbolic model checking for probabilistic processes. In P~ings, $4th ICALP (1997), LNCS, Springer-Verlag. To appear. Google Scholar
Digital Library
- 2.BAIER, C., AND KWlATKOWgKA, M. Model checking for a probabilistic branching time logic with fairness. Currently under revision for Distributed Computing. Google ScholarDigital Library
- 3.HANSSON, N AND JONSSON, B. A logic for reasoning about time and probability. Formal Aspects of Computing 6 (1994), 512-535.Google ScholarCross Ref
- 4.LYNCH, N., SAIAS, I., AND SECALA, R. Proving time bounds for randomized distributed algorithms. In Proceedings, PODC (1994), ACM CS Press, pp. 314-323. Google ScholarDigital Library
Index Terms
- Automatic verification of liveness properties of randomized systems
Recommendations
On the refinement of liveness properties of distributed systems
We present a new approach, based on simulation relations, for reasoning about liveness properties of distributed systems. Our contribution consists of (1) a formalism for defining liveness properties, (2) a proof method for liveness properties based on ...
Effective Liveness Verification Using a Transformation-Based Framework
VLSID '14: Proceedings of the 2014 27th International Conference on VLSI Design and 2014 13th International Conference on Embedded SystemsLiveness properties such as "will every request eventually get a grant?" are crucial to the verification of a variety of design types. Liveness properties may only be falsified by infinite-length counterexamples, represented using lasso-shaped traces ...
Comments