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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2008
Review
2008
In this paper, we present the Timed Abstract State Machine (TASM) lan- guage, which is a language for the specification of… 
2005
2005
We provide precise high-level models for eight fundamental service interaction patterns, together with schemes for their… 
2004
2004
In this work, we introduce slicing for Abstract State Machines (ASMs). The idea of this concept is analogous to the one of… 
2004
2004
SystemC is a system level language recently proposed to raise the abstraction level for embedded systems design and verification… 
2003
2003
Conventional computation models assume symbolic representations of states and actions. Gurevich's Abstract-State Machine model… 
2001
2001
Gurevich’s Abstract State Machines (ASMs) are widely used for the specification of software, hardware and algorithms and for the… 
Highly Cited
2000
Highly Cited
2000
In this paper we show how the specification and verification system PVS (Prototype Verification System) can provide tool support… 
1998
1998
When designing and implementing complex computer sys tems powerful description techniques are needed that allow the repre… 
1998
1998
An exercising device comprises a base member, a shaft rotatably mounted within the base member and a pulley mounted on each end… 
1994
1994
This paper provides the rst step of a full mathematical description of the APE100 parallel architecture. The description consists…