Filters








149,479 Hits in 5.7 sec

Reasoning about networks with many identical finite-state processes

E M Clarke, O Grumberg, M C Browne
1986 Proceedings of the fifth annual ACM symposium on Principles of distributed computing - PODC '86  
The basis fi~r the second induction is she ° last(B~ Applying CTL to Networks of Processes In order to reason about networks of identical processes, we need to be able to distinguish between the atomic  ...  formula only if neither gl nor contains any V operators.1 In practice, many of the most interesting properties of networks of identical processes can be expressed in the restricted logic.  ... 
doi:10.1145/10590.10611 dblp:conf/podc/ClarkeGB86 fatcat:zihylvok4zhnxkrj5ji7baloqm

Reasoning about networks with many identical finite state processes

M.C. Browne, E.M. Clarke, O. Grumberg
1989 Information and Computation  
APPLYING CTL* TO NETWORKS OF PROCESSES In order to reason about networks of identical processes, we need to be able to distinguish between the atomic propositions of the different processes.  ...  In practice, many of the most interesting properties of networks of identical processes can be expressed in the restricted logic.  ... 
doi:10.1016/0890-5401(89)90026-6 fatcat:7kk62vsynjathbg6excd3724pe

Page 229 of Distributed Computing Vol. 4, Issue 4 [page]

1991 Distributed Computing  
For instance, Browne, Clarke and Grumberg showed in [7] how to reason about (a restricted class oO temporal logic properties of networks containing many identical finite-state processes, using a notion  ...  German and Sistla [14] also introduced a method for dealing with properties of systems with many identical processes, again using a restricted temporal logic for specifying properties of networks.  ... 

A multiprocess network logic with temporal and spatial modalities

John Reif, A.P. Sistla
1985 Journal of computer and system sciences (Print)  
The spatial modal operators are useful to relate the properties of the current state of a given process with properties of the current state of neighboring processes.  ...  The various temporal modal operators can be used to relate the properties of the current state of a given process with properties of succeeding states of the same process.  ...  This combination of temporal and spatial modal operators allows us to formally reason about computations on networks with complex connections.  ... 
doi:10.1016/0022-0000(85)90003-0 fatcat:jkv23lkhmfh3pbxaqmgyjuqsd4

Graded state machines: The representation of temporal contingencies in simple recurrent networks

David Servan-Schreiber, Axel Cleeremans, James L. Mcclelland
1991 Machine Learning  
When the network is trained with strings from a particular finite-state grammar, it can learn to be a perfect finite-state recognizer for the grammar.  ...  For this reason, the network and other similar architectures may be called Graded State Machines.  ...  with the finite states of traditional automata.  ... 
doi:10.1007/bf00114843 fatcat:xehxkc4bezfurglq5j2js3rzhm

Graded State Machines: The Representation of Temporal Contingencies in Simple Recurrent Networks [chapter]

David Servan-Schreiber, Axel Cleeremans, James L. McClelland
1991 Connectionist Approaches to Language Learning  
When the network is trained with strings from a particular finite-state grammar, it can learn to be a perfect finite-state recognizer for the grammar.  ...  For this reason, the network and other similar architectures may be called Graded State Machines.  ...  with the finite states of traditional automata.  ... 
doi:10.1007/978-1-4615-4008-3_4 fatcat:ti7dx5hs7fhqxikknllw54tmze

The Value of Symbolic Computation

Whitney Tabor
2002 Ecological psychology  
The symbolic models are identical in behavior to certain special cases of the  ...  that many ecological psychologists have found insightful, especially for understanding limb movement and visual perception.  ...  Thanks to Chaopeng Zhou for discussions and help with running the simulations.  ... 
doi:10.1207/s15326969eco1401&2double_3 fatcat:d52daz6rubd2rf5pgr5fhe65ya

The Value of Symbolic Computation

Whitney Tabor
2002 Ecological psychology  
The symbolic models are identical in behavior to certain special cases of the  ...  that many ecological psychologists have found insightful, especially for understanding limb movement and visual perception.  ...  Thanks to Chaopeng Zhou for discussions and help with running the simulations.  ... 
doi:10.1080/10407413.2003.9652751 fatcat:gkv4mz3oszamjcru3cb7b6guna

Computations, residuals, and the power of indeterminacy [chapter]

Prakash Panangaden, Eugene W. Stark
1988 Lecture Notes in Computer Science  
We investigate the power of Katm-style datattow networks, with processes that may exhibit indeterminate behavior.  ...  Our main result is a theorem about networks of "monotone" processes, which shows: (1) that the input/output relation of such a network is a total and monotone relation; and (2) every relation that is total  ...  The use of residuals in reasoning about concurrent systems was demonstrated in [25] . Before proceeding with the presentation of our results, we comment on notation.  ... 
doi:10.1007/3-540-19488-6_133 fatcat:t3b63uwbdreg5giov4ti3unpzm

Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Corrected version) [article]

Javier Esparza
2014 arXiv   pre-print
These are systems composed of arbitrarily many components, all of them running exactly the same finite-state program. We discuss the complexity of deciding that no component reaches an unsafe state.  ...  We survey some results on the automatic verification of parameterized programs without identities.  ...  Many thanks to Sasha Rubin for contacting me about the errors in the former version, and for pointing out that the leaderless case for rendez-vous was studied in detail by German and Sistla in their seminal  ... 
arXiv:1405.1841v1 fatcat:ko4oglwwrnd53f2khz6qbygt3y

Finite-state analysis of security protocols [chapter]

John C. Mitchell
1998 Lecture Notes in Computer Science  
This short document, written to accompany the author's invited lecture, provide background information and references on finite-state methods that use standard model-checking tools.  ...  Acknowledgments: Thanks are due to Martin Abadi, David Dill, Cynthia Dwork, Stephen Freund, Li Gong, Mark Mitchell, John Rushby, Ulrich Stern, Vitaly Shmatikov and many others for helping me learn about  ...  We naturally want a system to perform correctly for any reasonable or anticipated input, and in spite of any variations in factors such as network transfer rates or the order in which tasks or processes  ... 
doi:10.1007/bfb0028734 fatcat:qgnnel4nwrgtxkugvuga3ljnn4

Nonexpressibility of fairness and signaling

David McAllester, Prakash Panangaden, Vasant Shanbhogue
1993 Journal of computer and system sciences (Print)  
These results are proved using a very crude notion of observation and thus apply in any reasonable theory of process equivalence.  ...  We consider split primitives with three differing fairness assumptions and show that they are strictly inequivalent in expressive power.  ...  We show how one can pass from these automata to traces of the networks, and then reason with traces exclusively after developing the machinery to reason about process equivalence and implementability.  ... 
doi:10.1016/0022-0000(93)90034-t fatcat:kt6c3iaahvhfnfwmdrglkptda4

Nonexpressibility of fairness and signaling

D. McAllester, P. Panangaden, V. Shanbhogue
1988 [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science  
These results are proved using a very crude notion of observation and thus apply in any reasonable theory of process equivalence.  ...  We consider split primitives with three differing fairness assumptions and show that they are strictly inequivalent in expressive power.  ...  We show how one can pass from these automata to traces of the networks, and then reason with traces exclusively after developing the machinery to reason about process equivalence and implementability.  ... 
doi:10.1109/sfcs.1988.21954 dblp:conf/focs/McAllesterPS88 fatcat:rmjunykmdjhwrbk7ww332hpf4a

Verifying networks of timed processes [chapter]

Parosh Aziz Abdulla, Bengt Jonsson
1998 Lecture Notes in Computer Science  
We present a method for deciding reachability properties of networks of timed processes. Such a network consists of an arbitrary set of identical timed automata, each with a single real-valued clock.  ...  To our knowledge, this is the first decidability result concerning verification of systems that are infmite-state in "two dimensions": they contain an arbitrary set of (identical) processes, and they use  ...  Intuitively, a network of timed processes consists of a controller and an arbitrarily large set of identical (timed) processes. The controller is a finite-state transition system.  ... 
doi:10.1007/bfb0054179 fatcat:h5yr77bt65gxljyjgyxruxpqei

Connectionism and the Rationale Constraint on Cognitive Explanation

Robert Cummins
1995 Philosophical Perspectives  
This will seem odd to those used to thinking about networks that learn, for, when a network learns, the weights change, yet surely the network retains its identity through learning.  ...  For many functions, such as addition, this presents no problem because the digits can be processed sequentially, with only enough memory required to handle carries.  ... 
doi:10.2307/2214214 fatcat:cohh4hel2bgybnx744tuaq6hq4
« Previous Showing results 1 — 15 out of 149,479 results