Gurevich’s sequential Abstract State Machines (ASMs) are taken as a basis for the construction of distributed ASMs as sets of sequential ASMs. A theorem on the expressive power of distributed ASM is proven in analogy to Gurevich’s classical theorem on the expressive power of sequential ASM
Abstract. Recent analysis of sequential algorithms resulted in their ax-iomatization and in a repres...
We introduce a logic for non distributed, deterministic Abstract State Machines with parallel functi...
AbstractThe abstract state machine (ASM) is a modern computation model. ASMs and ASM based tools are...
Gurevich’s sequential Abstract State Machines (ASMs) are taken as a basis for the construction of di...
Gurevich’s sequential Abstract State Machines (ASMs) are taken as a basis for the construction of di...
AbstractAbstract State Machines (ASMs) were introduced as “a computation model that is more powerful...
Conventional computation models assume symbolic representations of states and actions. Gurevich's Ab...
Published version of a chapter in the book: Abstract State Machines, Alloy, B, TLA, VDM, and Z. Also...
While sequential Abstract State Machines (ASM) capture the essence of sequential computation, it is ...
While sequential Abstract State Machines (ASM) capture the essence of sequential computation, it is ...
AbstractAbstract State Machines (ASMs) were introduced as “a computation model that is more powerful...
Abstract State Machines (ASM) have been introduced as “a computation model that is more powerful and...
"What is an algorithm?" is a fundamental question of computer science. Gurevich's behavioural theory...
Abstract. We define three composition and structuring concepts which reflect frequently used refinem...
Abstract. We define three composition and structuring concepts which reflect frequently used refinem...
Abstract. Recent analysis of sequential algorithms resulted in their ax-iomatization and in a repres...
We introduce a logic for non distributed, deterministic Abstract State Machines with parallel functi...
AbstractThe abstract state machine (ASM) is a modern computation model. ASMs and ASM based tools are...
Gurevich’s sequential Abstract State Machines (ASMs) are taken as a basis for the construction of di...
Gurevich’s sequential Abstract State Machines (ASMs) are taken as a basis for the construction of di...
AbstractAbstract State Machines (ASMs) were introduced as “a computation model that is more powerful...
Conventional computation models assume symbolic representations of states and actions. Gurevich's Ab...
Published version of a chapter in the book: Abstract State Machines, Alloy, B, TLA, VDM, and Z. Also...
While sequential Abstract State Machines (ASM) capture the essence of sequential computation, it is ...
While sequential Abstract State Machines (ASM) capture the essence of sequential computation, it is ...
AbstractAbstract State Machines (ASMs) were introduced as “a computation model that is more powerful...
Abstract State Machines (ASM) have been introduced as “a computation model that is more powerful and...
"What is an algorithm?" is a fundamental question of computer science. Gurevich's behavioural theory...
Abstract. We define three composition and structuring concepts which reflect frequently used refinem...
Abstract. We define three composition and structuring concepts which reflect frequently used refinem...
Abstract. Recent analysis of sequential algorithms resulted in their ax-iomatization and in a repres...
We introduce a logic for non distributed, deterministic Abstract State Machines with parallel functi...
AbstractThe abstract state machine (ASM) is a modern computation model. ASMs and ASM based tools are...