commissie aangewezen door het College voor Promoties in het openbaar te verdedigen op woensdag 24 febr uar i 1999 om 16.00 uur doo

De Rector Magnificus

G.L.J.M. Janssen

Geboren Te Oss

Gradus Leonardus

Janssen Gradus L. J. M

Johannes Maria Janssen

Prof. Dr. M. Rem

Voor Een

ion should be familiar from l-calculus [Baren84, Peyto87] and we have already used l-abstraction as a means to define functions in previous chapters. In µ-calculus we distinguish two main syntactic categories: formulas and terms. Intuitively,aformula asserts some relation to hold among the individual   84 µ-Calculus Chapter 7 variables appearing in the formula such that given values for those variables the formula may be evaluated to a boolean value. Aterm may be interpreted as a set of tuples of values from the domain, in other words it represents a relation.  Example 7.1 Beforegoing into the precise definition of the syntax and semantics of the µ-calculus, let us first look at a simple example. Let our universe of discourse, i.e. the domain, be the set of vertices V of a directed graph G ( V, E ). The edges of the graph define a binary relation E ÍV × V over the set of vertices: two vertices u and v arerelated iffthereexists an edge from u to v.The existence of a path (of non-zerole..

CiteSeerX

Logics for Digital Circuit Verification - Theory, Algorithms, and Applications

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.5125

prof.Dr.-Ing. J.A.G. Jess,en

Abstract

Similar works

Full text

Available Versions

CiteSeerX