This paper describes the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which can be viewed as a waiting time to discover all the factors of length n of the Sturmian word. This parameter is central to combinatorics of words. Having fixed a possible length n for the factors, we let α to be drawn uniformly from the unit interva...

in this paper a network comprising alternative branching nodes with probabilistic outcomes is considered. in other words, network nodes are probabilistic with exclusive-or receiver and exclusive-or emitter. first, an analytical approach is proposed to simplify the structure of network. then, it is assumed that the duration of activities is positive trapezoidal fuzzy number (tfn). this paper com...

considering the increasing interest in fuzzy theory and possible applications,the concept of fuzzy metric space concept has been introduced by severalauthors from different perspectives. this paper interprets the theory in termsof metrics evaluated on fuzzy numbers and defines a strong hausdorff topology.we study interrelationships between this theory and other fuzzy theories suchas intuitionis...

robust control design of vehicles addresses the effect of uncertainties on the vehicle’s performance. in present study, the robust optimal multi-objective controller design on a non-linear full vehicle dynamic model with 8-degrees of freedom having parameter with probabilistic uncertainty considering two simultaneous conflicting objective functions has been made to prevent the rollover. the obj...

This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingredient is a symbolic transformation of probabilistic process algebra terms that incorporate data into this linear format while preserving strong probabilistic bisimulation. This generalises similar techniques for traditional process algebras with data, and — more importantly — treats data and dat...

Probabilistic automata (PA) [20] have been successfully applied in the formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, where the most often used logics for expressing properties are based on PCTL [11] and its extension PCTL [4]. Various behavioral equivalences are proposed for PAs, as a powerful tool for abstraction and compositio...

We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the main behavioural relations on probabilistic nondeterministic processes, can be characterized by abstract interpretation. Both bisimulation and simulation can be obtained as completions of partitions and preorders, viewed as abstract domains, w.r.t. a pair of concrete functions that encode a PL...

We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it covers a rich class of probabilistic models and probabilistic temporal logics. The inference algorithms of existing probabilistic logic-programming systems are well defined only for qu...

In multi-target visual tracking, tracking failure due to missassociation can often arise from the presence of occlusions between targets. To cope with this problem, we propose the predictive estimation method that iterates occlusion prediction and occlusion status update using occlusion activity detection by utilizing joint probabilistic data association filter in order to track each target bef...