Sciweavers

1894 search results - page 180 / 379
» A TLA Proof System
Sort
View
IJBC
2010
77views more  IJBC 2010»
14 years 11 months ago
Spatio-Temporal Chaos in a Discrete Turing Model
In this paper, a discrete version of a reaction-diffusion equation, also known as coupled map lattice (CML), which corresponds to the Turing model of morphogenesis is studied. It i...
Hunseok Kang
RTA
2005
Springer
15 years 9 months ago
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...
SRDS
2006
IEEE
15 years 10 months ago
Improvements and Reconsideration of Distributed Snapshot Protocols
Distributed snapshots are an important building block for distributed systems, and, among other applications, are useful for constructing efficient checkpointing protocols. In ad...
Adnan Agbaria
IPPS
1998
IEEE
15 years 8 months ago
Tailoring UNITY to Distributed Program Design
As a general framework, UNITY does not offer any specific facility for the design of distributed systems. For such systems, distribution aspects must be represented at a low level,...
Michel Charpentier, Mamoun Filali, Philippe Mauran...
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
15 years 7 months ago
Dealing with stochastic reachability
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...
Manuela L. Bujorianu