State morphism MV-algebras

We present a complete characterization of subdirectly irreducible MV-algebras with internal states (SMV-algebras). This allows us to classify subdirectly irreducible state morphism MV-algebras (SMMV-algebras) and describe single generators of the variety of SMMV-algebras, and show that we have a continuum of varieties of SMMV-algebras

Flexible varieties and automorphism groups

Given an affine algebraic variety X of dimension at least 2, we let SAut (X) denote the special automorphism group of X i.e., the subgroup of the full automorphism group Aut (X) generated by all one-parameter unipotent subgroups. We show that if SAut (X) is transitive on the smooth locus of X then it is infinitely transitive on this locus. In turn, the transitivity is equivalent to the flexibility of X. The latter means that for every smooth point x of X the tangent space at x is spanned by the velocity vectors of one-parameter unipotent subgroups of Aut (X). We provide also different variations and applications.Comment: Final version; to appear in Duke Math.

A Toolset for Supporting UML Static and Dynamic Model Checking

The Unified Modeling Language has become widely accepted as a standard in software development. Several tools have been produced to support UML model validation. However, most of them support either static or dynamic model checking; and no tools support to check both static and dynamic aspects of a UML model . But a UML model should include the static and dynamic aspects of a software system. Furthermore, these UML tools translate a UML model into a validation language such as PROMELA. But they have some shortcomings: there is no proof of correctness (with respect to the UML semantics) for these tools. In order to overcome these shortcomings, we present a toolset which can validate both static and dynamic aspects of a model; and this toolset is based on the semantic model using Abstract State Machines. Since the toolset is derived from the semantic model, the toolset is correct with respect to the semantic model

Black holes in three dimensional higher spin gravity: A review

We review recent progress in the construction of black holes in three dimensional higher spin gravity theories. Starting from spin-3 gravity and working our way toward the theory of an infinite tower of higher spins coupled to matter, we show how to harness higher spin gauge invariance to consistently generalize familiar notions of black holes. We review the construction of black holes with conserved higher spin charges and the computation of their partition functions to leading asymptotic order. In view of the AdS/CFT correspondence as applied to certain vector-like conformal field theories with extended conformal symmetry, we successfully compare to CFT calculations in a generalized Cardy regime. A brief recollection of pertinent aspects of ordinary gravity is also given.Comment: 49 pages, harvmac, invited contribution to J. Phys. A special volume on "Higher Spin Theories and AdS/CFT" edited by M. R. Gaberdiel and M. Vasilie

Applying Formal Methods to Networking: Theory, Techniques and Applications

Despite its great importance, modern network infrastructure is remarkable for the lack of rigor in its engineering. The Internet which began as a research experiment was never designed to handle the users and applications it hosts today. The lack of formalization of the Internet architecture meant limited abstractions and modularity, especially for the control and management planes, thus requiring for every new need a new protocol built from scratch. This led to an unwieldy ossified Internet architecture resistant to any attempts at formal verification, and an Internet culture where expediency and pragmatism are favored over formal correctness. Fortunately, recent work in the space of clean slate Internet design---especially, the software defined networking (SDN) paradigm---offers the Internet community another chance to develop the right kind of architecture and abstractions. This has also led to a great resurgence in interest of applying formal methods to specification, verification, and synthesis of networking protocols and applications. In this paper, we present a self-contained tutorial of the formidable amount of work that has been done in formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial