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.
2018
2018
Graph algorithms that involve complex conditions on subgraphs can be specified much easier, if the specification allows… 
2009
2009
Abstract State Machines (ASMs) allow modeling system behaviors at any desired level of abstraction, including a level with rich… 
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… 
1998
1998
An exercising device comprises a base member, a shaft rotatably mounted within the base member and a pulley mounted on each end… 
1998
1998
When designing and implementing complex computer sys tems powerful description techniques are needed that allow the repre… 
1997
1997
This report presents a semantic analysis for VHDL-AMS, a mixed-signal extension of VHDL, based on an abstract state machine… 
1995
1995
The aim of this paper is to provide a logic for reasoning about evolving algebras [13, 14]. This is done by extending a variant… 
1995
1995
In this paper I answer the question how evolving algebras can be used for the design and analysis of complex hardware and…