Weighted automata generalize a number of concepts found in discrete event dynamics systems of various kind. Semirings are used as a base algebra for describing weights which implies a variety different interpretations for particular application cases. In this project, we want to explore how theoretical results in fact boil down to algorithms and techniques that work in practice. The goal of thi...

In this paper, we first introduce a network of learning automata, which we call it as distributed learning automata and then propose some iterative algorithms for solving stochastic shortest path problem. These algorithms use distributed learning automata to find a policy that determines a path from a source node to a destination node with minimal expected cost (length). In these algorithms, at...

In this paper, we present a theoretical approach for the problem of learning multiplicity tree automata. These automata allows one to define functions which compute a number for each tree. They can be seen as a strict generalization of stochastic tree automata since they allow to define functions over any field K. A multiplicity automaton admits a support which is a non deterministic automaton....

We compare the hybrid, stochastic, and differential semantics for stochastic Concurrent Constraint Programming, focussing on the exhibited behavior of models and their robustness. By investigating in detail two case studies, a circadian clock model and the Repressilator, we comment on the effect of the introduction of a limited amount of discreteness in the description of biological systems wit...

Cyber-physical-social systems (CPSS) have recently gained attention from researchers due to their combination of cyber, physical, and social spaces. Modeling Analysis Real-Time Embedded (MARTE) is a Unified Language (UML) extension profile that supports the specification, design, verification Systems (RTES). While MARTE Statecharts can assist in describing CPS, it does not model uncertainty wit...

We introduce the Hybrid Automata Stochastic Logic (HASL), a new temporal logic formalism for the verification of discrete event stochastic processes (DESP). HASL employs Linear Hybrid Automata (LHA) as machineries to select prefixes of relevant execution paths of a DESP D. The advantage with LHA is that rather elaborate information can be collected on-the-fly during path selection, providing th...

This paper is concerned with the widest class of automaton structures whose semantics is compatible with our notions of state and automaton. It is first shown that the conventional spectrum of deterministic, stochastic, fuzzy and non-deterministic can be fitted into a single framework which is complete. In particular new results on the normalization of fuzzy automata and the relationship betwee...

In this paper, we introduce MIOA, a stochastic process algebralike specification language with datatypes, as well as a logic intSPDL, and its model checking algorithms. MIOA which stands for Markovian input/output automata language, is an extension of Lynch’s input/automata with Markovian timed transitions. MIOA can serve both as a fully fledged “stand-alone” specification language and the sema...