## Foundations of Software Technology and Theoretical Computer Science |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

System Specification and Refinement in Temporal | 2 |

Concurrency | 6 |

Fixed Points of Buchi Automata | 39 |

Copyright | |

19 other sections not shown

### Common terms and phrases

abstract domain abstract interpretation algorithm analysis apply approximation assume automata automaton bisimulation BL-approach boolean bounded circuits closure complexity classes components Computer Science consider constant construction corresponding data structure decision problems defined Definition Delaunay triangulation denote edge endpoint equivalent example exists exponential hierarchy finite fixed point formula given hierarchy hyperplanes implementation induction infinite input integer intersection interval Interval Logic iteration language Lemma linear many-one reductions matroid minimum module monomial NEXP node NP-complete one-way function operator oracle oracle Turing machine p-isomorphic pair partition planar straight-line graph polygon polynomial polynomial-time predicate problem Proc proof prove PSLG PSPACE query randomized recursive reductions relation result rule satisfies segment semantics sparse sets string subset superfinite technique temporal logic Theorem transition relation transition system tree triangulation of G Turing machine variables vertex vertices