Sciweavers

31387 search results - page 37 / 6278
» Abstracting abstract machines
Sort
View
FGCS
2000
96views more  FGCS 2000»
13 years 9 months ago
Logicflow execution model for parallel databases
The LOGFLOW parallel Prolog system is similar to the recent parallel database systems concerning its dataflow execution model and its capability of running on othing architectures...
Péter Kacsuk, Norbert Podhorszki
ICCD
1993
IEEE
124views Hardware» more  ICCD 1993»
14 years 2 months ago
Synthesis of Controllers from Interval Temporal Logic Specification
for a state machine which is an abstraction for an existing sequential circuit, which can be useful for redesign or engineering change. The generated state machines can be further ...
Masahiro Fujita, Shinji Kono
FOSSACS
2008
Springer
13 years 11 months ago
Coalgebraic Logic and Synthesis of Mealy Machines
Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds t...
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexan...
STACS
2010
Springer
14 years 4 months ago
Evolving Multialgebras Unify All Usual Sequential Computation Models
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
Serge Grigorieff, Pierre Valarcher
ASM
2005
ASM
14 years 3 months ago
Verifying Security Protocols: An ASM Approach
In this paper we present a modeling technique for security protocols using Abstract State Machines [BS03,Gur95] (ASMs). We describe how we model the different agents in the scenar...
Dominik Haneberg, Holger Grandy, Wolfgang Reif, Ge...