scholarly journals Spacecraft expected-cost analysis with k-out-of-n:G subsystems

1995 ◽  
Vol 32 (5) ◽  
pp. 927-928 ◽  
Author(s):  
Ron Suich ◽  
Richard Patterson
Keyword(s):  

2020 ◽  
Vol 4 (ICFP) ◽  
pp. 1-31
Author(s):  
Di Wang ◽  
David M. Kahn ◽  
Jan Hoffmann
Keyword(s):  




2001 ◽  
Vol 23 (11) ◽  
pp. 1904-1921 ◽  
Author(s):  
Albert Marchetti ◽  
Raf Magar ◽  
Helen Lau ◽  
Erin L. Murphy ◽  
Peter S. Jensen ◽  
...  


2021 ◽  
Vol 5 (ICFP) ◽  
pp. 1-30
Author(s):  
Martin Avanzini ◽  
Gilles Barthe ◽  
Ugo Dal Lago

We define a continuation-passing style (CPS) translation for a typed λ-calculus with probabilistic choice, unbounded recursion, and a tick operator — for modeling cost. The target language is a (non-probabilistic) λ-calculus, enriched with a type of extended positive reals and a fixpoint operator. We then show that applying the CPS transform of an expression M to the continuation λ v . 0 yields the expected cost of M . We also introduce a formal system for higher-order logic, called EHOL, prove it sound, and show it can derive tight upper bounds on the expected cost of classic examples, including Coupon Collector and Random Walk. Moreover, we relate our translation to Kaminski et al.’s ert-calculus, showing that the latter can be recovered by applying our CPS translation to (a generalization of) the classic embedding of imperative programs into λ-calculus. Finally, we prove that the CPS transform of an expression can also be used to compute pre-expectations and to reason about almost sure termination.





1989 ◽  
Vol 7 (1) ◽  
pp. 27-41 ◽  
Author(s):  
Norman Keith Womer
Keyword(s):  


1994 ◽  
Vol 49 (12) ◽  
pp. 1088-1089 ◽  
Author(s):  
David R. Holtgrave


Sign in / Sign up

Export Citation Format

Share Document