Sciweavers

2950 search results - page 12 / 590
» Computing with Infinitely Many Processes
Sort
View
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 3 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...
CONCUR
2007
Springer
14 years 19 days ago
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
Rohit Chadha, Mahesh Viswanathan
ICCAD
2007
IEEE
165views Hardware» more  ICCAD 2007»
14 years 17 days ago
Automated refinement checking of concurrent systems
Stepwise refinement is at the core of many approaches to synthesis and optimization of hardware and software systems. For instance, it can be used to build a synthesis approach for...
Sudipta Kundu, Sorin Lerner, Rajesh Gupta

Book
361views
15 years 6 months ago
Introduction to Statistical Signal Processing
"A random or stochastic process is a mathematical model for a phenomenon that evolves in time in an unpredictable manner from the viewpoint of the observer. The phenomenon m...
R.M. Gray
JIFS
2002
60views more  JIFS 2002»
13 years 8 months ago
Turing's analysis of computation and artificial neural networks
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
Wilson Rosa de Oliveira, Marcílio Carlos Pe...