Micron’s Automata Processor (AP) is a configurable memorybased device, purpose-built to emulate a theoretical nondeterministic finite automata (NFA). While NFAs are not particularly suited for floating point computation, they are extremely powerful and efficient pattern matchers and have been shown to provide large speedups over traditional von Neumann execution for rule-based, data-mining appl...

For verification and performance evaluation, system models that can express stochastic as well as real-time behaviour are of increasing importance. Although an integrated stochastic-timed verification procedure is highly desirable, both model-checking and simulation currently fall short of providing a complete, fully automatic verification solution. For model-checking, the problem lies in the e...

In this paper we present a compositional semantics for the channel-based coordination language Reo that enables the analysis of quality of service (QoS) properties of service compositions. For this purpose, we annotate Reo channels with stochastic delay rates and explicitly model data-arrival rates at the boundary of a connector, to capture its interaction with the services that comprise its en...

In the paper the idea of timed automata simulator is introduced. The proposed simulator is an extension of the UPPAAL tool simulator. Instead of choosing transition to be performed randomly or manually, the simulator calculates transition times according to transition guard and state invariant for each transition. A probability density function, which is needed for such calculation, is formally...

Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of these finite state machines. In the setting of identification in the limit with probability one, we prove that stochastic deterministic finite automata cannot be identified from only a polynomial quantity of data. If concerned wit...

A stochastic timed automaton is a purely stochastic process defined on a timed automaton, in which both delays and discrete choices are made randomly. We study the almost-sure model-checking problem for this model, that is, given a stochastic timed automaton A and a property φ, we want to decide whether A satisfies φ with probability 1. In this paper, we identify several classes of automata and...

This paper describes the MQNA Markovian Queueing Networks Analyser, a software tool to model and obtain the stationary solution of a large class of Queueing Networks. MQNA can directly solve open and closed product-form queueing networks using classical algorithms. For finite capacity queueing models, MQNA generates Markovian description in the Stochastic Automata Networks (SAN) and Stochastic ...

Preface This issue contains seven papers presented during the " Third Symposium on Cellular Automata– Journées Automates Cellulaires " (JAC 2012), held in La Marana, Corsica (France) in the period Septem-ber 19th–21th, 2012. The scope of the symposium is centered on Cellular Automata (CA), tilings and related models of computation. Topics of interest include (but are not limited to) algorithmic...