We give a sound and complete labeled natural deduction system for an interesting fragment of CTL∗ , namely the until-free version of BCTL∗ . The logic BCTL∗ is obtained by re...
We provide a translation from CTL to Datalog¬ Succ. The translation has the following advantages: a) It is natural. b) It provides intuition to the expressive power of CTL and it...
Foto N. Afrati, Theodore Andronikos, Vassia Pavlak...
We present a natural deduction calculus for the computation tree logic CTL defined with the full set of classical and temporal logic operators. The system extends the natural ded...
Alexander Bolotov, Oleg Grigoriev, Vasilyi Shangin
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...