@prefix rdf: . @prefix dbpedia: . @prefix ns2: . dbpedia:Abstract_state_machines rdf:type ns2:FormalMethods , ns2:ComputationalModels . @prefix owl: . dbpedia:Abstract_state_machines owl:sameAs . @prefix foaf: . @prefix ns5: . dbpedia:Abstract_state_machines foaf:page ns5:Abstract_state_machines . @prefix dbpprop: . dbpedia:Abstract_state_machines dbpprop:reference , . @prefix rdfs: . dbpedia:Abstract_state_machines rdfs:label "Abstract state machine"@it , "Abstract state machines"@en , "Abstrakte Zustandsmaschine"@de ; dbpprop:abstract "In computer science, an abstract state machine (ASM) is a state machine operating on states which are arbitrary data structures (structure in the sense of mathematical logic, that is a nonempty set together with a number of functions and relations). The ASM Method is a practical and scientifically well-founded systems engineering method which bridges the gap between the two ends of system development: the human understanding and formulation of real-world problems (requirements capture by accurate high-level modeling at the level of abstraction determined by the given application domain) the deployment of their algorithmic solutions by code-executing machines on changing platforms (definition of design decisions, system and implementation details). The method builds upon three basic concepts: ASM: a precise form of pseudo-code, generalizing Finite State Machines to operate over arbitrary data structures ground model: a rigorous form of blueprints, serving as authoritative reference model for the design refinement: a most general scheme for stepwise instantiations of model abstractions to concrete system elements, providing controllable links between the more and more detailed descriptions at the successive stages of system development. In the original conception of ASMs, a single agent executes a program in a sequence of steps, possibly interacting with its environment. This notion was extended to capture distributed computations, in which multiple agents execute their programs concurrently. Since ASMs model algorithms at arbitrary levels of abstraction, they can provide high-level, low-level and mid-level views of a hardware or software design. ASM specifications often consist of a series of ASM models, starting with an abstract ground model and proceeding to greater levels of detail in successive refinements or coarsenings. Due to the algorithmic and mathematical nature of these three concepts, ASM models and their properties of interest can be analyzed using any rigorous form of verification (by reasoning) or validation (by experimentation, testing model executions)."@en , "Nel campo dell'informatica il termine Abstract State Machine (letteralmente macchina a stati astratti) o ASM \u00E8 usato spesso come sinonimo di macchina a stati finiti per quanto riguarda gli algoritmi astratti. Una particolare teoria sull'utilizzo degli ASM per la specifica formale \u00E8 stata sviluppata da Yuri Gurevich."@it , "Eine abstrakte Zustandsmaschine (englisch Abstract State Machine, ehemals auch Evolving Algebra genannt), ist in der Informatik ein Modell zur formalen, operationellen Beschreibung von Algorithmen. Anders als bei endlichen Automaten, deren Zust\u00E4nde lediglich Namen haben, sind die Zust\u00E4nde einer ASM allgemeine mathematische Strukturen. Insbesondere im Gebiet des \u00DCbersetzerbaus dient das Modell der Beschreibung der Semantik des zu \u00FCbersetzenden Programms, und es hilft sicherzustellen, dass die Semantik des zu \u00FCbersetzenden Programms erhalten bleibt. Aber auch bei der Entwicklung von Software im Allgemeinen erlaubt das Modell in der Analyse- und Entwurfsphase eine formale Beschreibung der funktionalen Anforderungen. Diese mathematische Herangehensweise verbessert beispielsweise Verifizierbarkeit und Wiederverwendbarkeit."@de ; rdfs:comment "In computer science, an abstract state machine (ASM) is a state machine operating on states which are arbitrary data structures (structure in the sense of mathematical logic, that is a nonempty set together with a number of functions and relations)."@en , "Eine abstrakte Zustandsmaschine (englisch Abstract State Machine, ehemals auch Evolving Algebra genannt), ist in der Informatik ein Modell zur formalen, operationellen Beschreibung von Algorithmen. Anders als bei endlichen Automaten, deren Zust\u00E4nde lediglich Namen haben, sind die Zust\u00E4nde einer ASM allgemeine mathematische Strukturen."@de , "Nel campo dell'informatica il termine Abstract State Machine (letteralmente macchina a stati astratti) o ASM \u00E8 usato spesso come sinonimo di macchina a stati finiti per quanto riguarda gli algoritmi astratti. Una particolare teoria sull'utilizzo degli ASM per la specifica formale \u00E8 stata sviluppata da Yuri Gurevich."@it . @prefix skos: . @prefix ns9: . dbpedia:Abstract_state_machines skos:subject ns9:Formal_methods , ns9:Computational_models . @prefix ns10: . dbpedia:Abstract_state_machines dbpprop:hasPhotoCollection ns10:Abstract_state_machines . dbpedia:Abstract_State_Machines dbpprop:redirect dbpedia:Abstract_state_machines . dbpedia:Evolving_Algebras dbpprop:redirect dbpedia:Abstract_state_machines . dbpedia:Abstract_State_Machine dbpprop:redirect dbpedia:Abstract_state_machines . dbpedia:Abstract_state_machine dbpprop:redirect dbpedia:Abstract_state_machines . @prefix yago: . yago:Abstract_state_machines owl:sameAs dbpedia:Abstract_state_machines .