RAM Simulation of BGS Model of Abstract State Machines

lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, USA, 2 Department of Computer Science and Engineering IIT Kanpur, Kanpur 208016, India We show in this paper that the BGS model of abstract state machines can be simulated by random access machines with at most a polynomial time overhead. This result is already stated in [BGS99] with a very brief proof sketch. The present paper gives a detailed proof of the result. We represent hereditarily finite sets, which are the typical BGS ASM objects, by membership graphs of the transitive closure of the sets. Testing for equality between BGS objects can be done in linear time in our representation.

• Type: Conference
• Year: 2005
• Where: ASM
• Authors: Seshadhri Comandur, Anil Seth, Somenath Biswas
• Keywords: Abstract State Machines, ASM 2005, BGS Model, Computer Science, Microbiology