Skip to search formSkip to main contentSkip to account menu

Abstract state machines

Known as: ASM, Abstract State Machine, Evolving Algebras 
In computer science, an abstract state machine (ASM) is a state machine operating on states which are arbitrary data structures (structure in the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

23 relations
AlgorithmAxiomatic systemChurch–Turing thesisComputer hardware

Broader (1)

Formal methods

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Dynamic Data Warehouse Design with Abstract State Machines
On-line analytical processing (OLAP) systems deal with analytical tasks that support decision making. As these tasks do not… 
Review
2008
Review
2008
The Timed Abstract State Machine Language: Abstract State Machines for Real-Time System Engineering
In this paper, we present the Timed Abstract State Machine (TASM) lan- guage, which is a language for the specification of… 
2008
2008
WSMO Choreography: From Abstract State Machines to Concurrent Transaction Logic
Several approaches to semantic Web services, including OWLS, SWSF, and WSMO, have been proposed in the literature with the aim to… 
2004
2004
Slicing Abstract State Machines
In this work, we introduce slicing for Abstract State Machines (ASMs). The idea of this concept is analogous to the one of… 
2004
2004
Enabling SystemC Verification using Abstract State Machines
SystemC is a system level language recently proposed to raise the abstraction level for embedded systems design and verification… 
2003
2003
The Expressive Power of Abstract-State Machines
Conventional computation models assume symbolic representations of states and actions. Gurevich's Abstract-State Machine model… 
Highly Cited
2000
Highly Cited
2000
Encoding Abstract State Machines in PVS
In this paper we show how the specification and verification system PVS (Prototype Verification System) can provide tool support… 
1998
1998
Object-based abstract state machines
When designing and implementing complex computer sys tems powerful description techniques are needed that allow the repre… 
1998
1998
Interacting Abstract State Machines
An exercising device comprises a base member, a shaft rotatably mounted within the base member and a pulley mounted on each end… 
1997
1997
Typed Gurevich Machines Revisited
An approach to combining type-structured algebraic speciications with Gure-vich Machines (evolving algebras) is proposed. A type… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)