Sciweavers

898 search results - page 5 / 180
» Transitions of the Pre-Symmetry Set
Sort
View
112
Voted
NC
2007
123views Neural Networks» more  NC 2007»
15 years 1 months ago
The complexity of latching transitions in large scale cortical networks
Abstract. We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an in...
Emilio Kropff, Alessandro Treves
IANDC
1998
106views more  IANDC 1998»
15 years 1 months ago
A Conservative Look at Operational Semantics with Variable Binding
We set up a formal framework to describe transition system specifications in the style of Plotkin. This framework has the power to express many-sortedness, general binding mechan...
Wan Fokkink, Chris Verhoef
142
Voted
IFIP
2010
Springer
14 years 8 months ago
A Calculus for the Analysis of Wireless Network Security Protocols
We propose a timed broadcasting calculus for wireless systems. The operational semantics of our calculus is given both in terms of a Reduction Semantics and in terms of a Labelled ...
Francesco Ballardin, Massimo Merro
191
Voted
TGC
2010
Springer
14 years 11 months ago
Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chain...
Marco Bernardo, Rocco De Nicola, Michele Loreti
DM
1999
145views more  DM 1999»
15 years 1 months ago
Modular decomposition and transitive orientation
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Ross M. McConnell, Jeremy Spinrad