IntroductiontoASMs-WSMO.pptVIP

Introduction to ASMs /gasm/ Dumitru Roman Digital Enterprise Research Institute dumitru.roman@ Outline ASMs Characteristics ASMs Definition Abstract States Abstract Instructions for Changing States AsmL: an ASM engine An example DASMs for formalizing BPEL4WS ASMs overview A practical method for rigorous system development which has been used successfully under industrial constraints for design and analysis of complex hardware/software systems. Formalism for modelling/formalising algorithms Previously known as Evolving algebras An attempt to bridge the gap between formal models of computation and practical specification methods. ASM methodology characteristics/gasm/intro.html Precision: ASMs use classical mathematical structures that are well-understood Faithfulness: ASMs require a minimal amount of notational coding Understandability: ASMs use an extremely simple syntax, which can be read as a form of pseudo-code Executablity: ASMs can be tested by executing them Scalability: ASMs can describe a system/algorithm on different levels of abstraction Generality: ASMs have been shown to be useful in many different application domains Abstract States (1) States can be viewed as (first-order) structures of mathematical logic Structures - syntax A vocabulary contains: A finite collection of function names, each of a fixed arity The equality sign, and nullary names true, false, undef, and unary name Boole, and the names of the usual Boolean operations Terms - defined by the usual induction: A nullary function name is a term. If f is a function name of positive arity j and if t1,…,tj are terms, then f(t1,…,tj ) is a term. Abstract States (2) Structures – semantics A structure X of vocabulary T is a nonempty set S together with interpretations of the function names in T over S A j-ary function name is interpreted as a function from Sj to S A nullary function is identified with its value. The interpretation of a j-ary relation R is a function from Sj to {true; false} The e