23rd Desi gn Aut omati on Conf erence (June,1986).
نویسندگان
چکیده
Wepresent a systemfor verifyingthe timing speci cations of digital interfaces. The systemis based on a static analysis of the temporal protocols on the control signals whichmake up the interface. Veri cationis performedbycheckingthat nocausal chainof events onthe control signals violates any of the protocol constraints on those same signals. While the systemdoes not performanychecking of functional behavior, it does support multiple systemstates and state transitions. This allows for checkingof conditionals andloops withinthe protocols. Inthis waywehaveabstractedout the notion of timingfromthemore general notionof behavior byfocusingononlythe control informationof the circuits.
منابع مشابه
Automorphisms of the Graph of Free Splittings
We prove that every simplicial automorphism of the free splitting graph of a free group Fn is induced by an outer automorphism of Fn for n ≥ 3. In this note we consider the graph Gn of free splittings of the free group Fn of rank n ≥ 3. Loosely speaking, Gn is the graph whose vertices are non-trivial free splittings of Fn up to conjugacy, and where two vertices are adjacent if they are represen...
متن کاملCausal Behaviours and Nets
\Abandonment of causal ity as a matter of principl e shoul d be permitted onl y in the most extreme emergency" Abstract. Speciication formalisms in which causality and independence of actions can be explicitlyexpressed are beneecialfrom a design point of view. The explicit presence (or absence) of a causal dependency between actions can be used eeectivelyduring the design. We considera speciica...
متن کاملHomological Stability for automorphism groups of Raags
The stabilization of Hi(Aut(G);Z) for i large has been shown to hold for most groups by the main theorem of [3] and [9, Corollary 1.3].1 The stabilization of Hi(Aut(G);Z) in contrast has so far only been known in two extreme cases: when G is abelian and when G has trivial center and does not factorize as a direct product. Indeed, in the first case Aut(Gn) is isomorphic to GLn(End(G)), which is ...
متن کاملAutomorphism groups of Lorentzian lattices
Journal of Algebra, Vol. 111, No. 1, Nov 1987, 133–153. Richard E. Borcherds, D.P.M.M.S., University of Cambridge, 16 Mill Lane, Cambridge, CB2 1SB, England. The study of automorphism groups of unimodular Lorentzian lattices In,1 was started by Vinberg. These lattices have an infinite reflection group (if n ≥ 2) and Vinberg showed that the quotient of the automorphism group by the reflection gr...
متن کاملUniqueness of maximal entropy measure on essential spanning forests
An essential spanning forest of an infinite graph G is a spanning forest of G in which all trees have infinitely many vertices. Let Gn be an increasing sequence of finite connected subgraphs of G for which ∪Gn = G. Pemantle’s arguments (1991) imply that the uniform measures on spanning trees of Gn converge weakly to an Aut(G)-invariant measure μG on essential spanning forests of G. We show that...
متن کامل