Sciweavers

16 search results - page 1 / 4
» A Labeled Natural Deduction System for a Fragment of CTL*
Sort
View
LFCS
2009
Springer
14 years 1 months ago
A Labeled Natural Deduction System for a Fragment of CTL*
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...
Andrea Masini, Luca Viganò, Marco Volpe
BIRTHDAY
2003
Springer
14 years 18 days ago
From CTL to Datalog
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...
JVA
2006
IEEE
14 years 1 months ago
Natural Deduction Calculus for Computation Tree Logic
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
RTA
2004
Springer
14 years 22 days ago
Rewriting for Fitch Style Natural Deductions
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...
Herman Geuvers, Rob Nederpelt
IANDC
2010
116views more  IANDC 2010»
13 years 6 months ago
Weak bisimulation is sound and complete for pCTL*
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...
Josée Desharnais, Vineet Gupta, Radha Jagad...