Sciweavers

2467 search results - page 95 / 494
» Finite State Machines
Sort
View
WSC
2000
15 years 6 months ago
Java engine for UML based hybrid state machines
One of the approaches to modeling hybrid systems is to assign algebraic-differential equations describing the continuous behavior to states of state machines that represent discre...
Andrei Borshchev, Yuri B. Kolesov, Yuri B. Seniche...
AMAST
2004
Springer
15 years 9 months ago
Refining Mobile UML State Machines
We study the semantics and refinement of mobile objects, considering an extension of core UML state machines by primitives that designate the location of objects and their moves wi...
Alexander Knapp, Stephan Merz, Martin Wirsing
126
Voted
JCT
2006
72views more  JCT 2006»
15 years 5 months ago
Arboricity and tree-packing in locally finite graphs
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
Maya Jakobine Stein
WDAG
2010
Springer
230views Algorithms» more  WDAG 2010»
15 years 3 months ago
Implementing Fault-Tolerant Services Using State Machines: Beyond Replication
Abstract—This paper describes a method to implement faulttolerant services in distributed systems based on the idea of fused state machines. The theory of fused state machines us...
Vijay K. Garg
172
Voted
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 5 months ago
Superstate identification for state machines using search-based clustering
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
Mathew Hall, Phil McMinn, Neil Walkinshaw