In this paper we introduce a new research effort in making abstract state machines executable. The aim is to specify and implement an execution engine for a language that is as close as possible to the mathematical definition of pure ASM. The paper presents the general architecture of the engine, together with a high-level description of the extensibility mechanisms that are used by the engine to accommodate arbitrary backgrounds, scheduling policies, and new rule forms.

state machines executable. The aim is to specify and implement an execution engine for a language that is as close as possible to the mathematical definition of pure ASM. We present the general architecture of the engine, together with a high-level description of the extensibility mechanisms that are used by the engine to accommodate arbitrary backgrounds, scheduling policies, and new rule forms. 1

By combining the abstract state machine (ASM) formalism with the multi-agent modeling paradigm, we obtain a formal framework for semantic modeling and integration of established theories of crime analysis and prediction. We focus here on spatial and temporal aspects of crime in urban areas. Our work contributes to a novel interdisciplinary research effort broadly classified as Computational Criminology.

The Business Process Execution Language for Web Services (BPEL) is a forthcoming industrial standard for automated business processes, proposed by the OASIS1 Web Services BPEL Technical Committee. BPEL is a service orchestration language which extends the underlying Web services interaction model and enables Web services to support long running business transactions. state machine (ASM) paradigm. Specifically, we model the dynamic properties of the key language constructs through the construction of a BPEL Abstract Machine in terms of partially ordered runs of distributed real-time ASMs. The goal of our work is to provide a well defined semantic foundation for establishing the key language attributes by eliminating deficiencies hidden in the informal language definition. This work combines two well-defined ASM refinement techniques to complement our previous efforts on the core model of the BPEL Abstract Machine. First, we elaborate the core model with regard to structural and behavioural aspects to make it more robust and