Underlying computational model has an important role in any computation. The state and transition (such as automata) rule value Lisp logic programming) are two comparable counterpart models. Both of deductive checking verification techniques relying on a notion result, their underlying models dependent. Some problems compliance by which under system is verified against some regulations rules) h...

May-June 2012 To the Editor: In the SeptemberOctober 2011 issue, Daniel Groll addresses the question of what health care providers can know about patients’ interests (“What Health Care Providers Know”). He offers helpful refinements to my claim in Patient, Heal Thyself (Oxford, 2008) that generally health providers cannot know what serves patient interests. I am honored that a careful student o...

In this draft, we settle a problem in probabilistic verification of infinite–state processes (probabilistic pushdown systems). We show that model checking stateless probabilistic pushdown systems (pBPA) against probabilistic computational tree logic (PCTL) is undecidable.