Sciweavers

898 search results - page 90 / 180
» Transitions of the Pre-Symmetry Set
Sort
View
DLT
2003
15 years 7 months ago
NFA Reduction Algorithms by Means of Regular Inequalities
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
Jean-Marc Champarnaud, Fabien Coulon
FORTE
1994
15 years 7 months ago
Four issues concerning the semantics of Message Flow Graphs
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...
Peter B. Ladkin, Stefan Leue
ENTCS
2010
99views more  ENTCS 2010»
15 years 6 months ago
State Based Robustness Testing for Components
Component based development allows to build software upon existing components and promises to improve software reuse and reduce costs. To gain reliability of a component based sys...
Bin Lei, Zhiming Liu, Charles Morisset, Xuandong L...
IJBC
2006
50views more  IJBC 2006»
15 years 6 months ago
Phenomenology of Reaction-diffusion Binary-State Cellular Automata
We study a binary-cell-states eight-cell neighborhood two-dimensional cellular automaton model of a quasi-chemical system with a substrate and a reagent. Reactions are represented...
Andrew Adamatzky, Genaro Juárez Martí...
ENTCS
2007
109views more  ENTCS 2007»
15 years 6 months ago
Modular Structural Operational Semantics with Strategies
Strategies are a powerful mechanism to control rule application in rule-based systems. For instance, different transition relations can be defined and then combined by means of ...
Christiano Braga, Alberto Verdejo