Time & Logic : A Computational Approach book cover
SAVE
$9.00
1st Edition

Time & Logic
A Computational Approach





  • Available for pre-order. Item will ship after September 30, 2021
ISBN 9780367336578
September 30, 2021 Forthcoming by Routledge
336 Pages

 
SAVE ~ $9.00
was $45.00
USD $36.00

Prices & shipping based on shipping country


Preview

Book Description

Originally published in 1995 Time and Logic examines understanding and application of temporal logic, presented in computational terms. The emphasis in the book is on presenting a broad range of approaches to computational applications. The techniques used will also be applicable in many cases to formalisms beyond temporal logic alone, and it is hoped that adaptation to many different logics of program will be facilitated. Throughout, the authors have kept implementation-orientated solutions in mind. The book begins with an introduction to the basic ideas of temporal logic. Successive chapters examine particular aspects of the temporal theoretical computing domain, relating their applications to familiar areas of research, such as stochastic process theory, automata theory, established proof systems, model checking, relational logic and classical predicate logic. This is an essential addition to the library of all theoretical computer scientists. It is an authoritative work which will meet the needs both of those familiar with the field and newcomers to it.

Table of Contents

Preface

1. Temporal Logic of Programs: Standard Approach, A. Szałas

2. Effective Temporal Logics of Programs, H. Andréka, V. Goranko, S. Mikulás, I. Németim, I. Sain

3. On the Relation of Programs and Computations to Models of Temporal Logic, P. Wolper

4. Branching Time and Partial Order in Temporal Logics, W. Penczek

5. Temporal Logic in Stochastic Environment, B. Strulo, D. Gabbay, P.G. Harrison

6. Relational Proof Systems for Applied Temporal Logics, E. Orlowska

7. An Analysis of Structure of Time in the First Order Predicate Calculus, E. Hajnicz

Index

...
View More