نتایج جستجو برای: timed breeding

تعداد نتایج: 72420  

Journal: :iranian rehabilitation journal 0
ahmad ali akbari kamrani university of social welfare and rehabilitation sciences, tehran, iran. seyed hojjat zamani sani shahid beheshti university, tehran, iran. zahra fathi rezaie shahid beheshti university, tehran, iran. mohammad taghi aghdasi tabriz university, tabriz, iran.

objectives: the purpose of this study was to evaluate the concurrent validity of the farsi version of functional gait assessment (fga), timed up & go (tug), and gait speed tests in persian communitydwelling older adults. methods: subjects were 100 males in falling or no falling history group (50 subjects in each group). subjects were community-dwelling adults aged 60-90 years who were living in...

Journal: :Computing and Informatics 2010
Ka Lok Man

Timed Chi (χ) is a timed process algebra, designed for Modeling, simulation, verification and real-time control. Its application domain consists of large and complex manufacturing systems. The straightforward syntax and semantics are also highly suited to architects, engineers and researchers from the hardware design community. There are many different tools for timed Chi that support the analy...

2006
Elena S. Oshevskaya

The intention of the paper is to show the applicability of the general categorical framework of open maps to the setting of real-time models of concurrency, in order to transfer general concepts of equivalences to the models. In particular, we define a category of timed higher dimensional automata (timed HDA), whose morphisms are to be thought of as simulations, and an accompanying (sub)categor...

Journal: :Logical Methods in Computer Science 2008
Piero A. Bonatti Carsten Lutz Aniello Murano Moshe Y. Vardi

Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks. Firstly, we show that Pctl probabilistic model-checking problems (such as determining whether a set of target states can be reached with probability at least 0.99 regardless...

2009
Christel Baier Nathalie Bertrand Patricia Bouyer Thomas Brihaye

In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boundedness condition, the infinite timed tree can be reduced into a classical deterministic timed automaton. The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be d...

2013
Zeynab Sabahi-Kaviani Ramtin Khosravi Marjan Sirjani Peter Csaba Ölveczky Ehsan Khamespanah

The actor model is one of the main models for asynchronous and distributed computation. Timed Rebeca is a timed extension of the actor-based modeling language Rebeca. Although Rebeca is supported by a rich verification toolset, Timed Rebeca has not had an executable formal semantics, and has therefore had limited support for formal analysis. In this paper, we provide a formal semantics of Timed...

Journal: :CoRR 2017
Parosh Aziz Abdulla Mohamed Faouzi Atig Shankara Narayanan Krishna

In this paper, we introduce the model of communicating timed automata (CTA) that extends the classical models of finite-state processes communicating through FIFO perfect channels and timed automata, in the sense that the finite-state processes are replaced by timed automata, and messages inside the perfect channels are equipped with clocks representing their ages. In addition to the standard o...

2007
Jacques Julliand Hassan Mountassir Emilie Oudot

We are interested in the preservation of local properties of timed components during their integration in a timed system. Timed components are modeled as timed automata or timed automata with deadlines. Properties considered are all safety and liveness properties which can be expressed with the timed linear logic MITL (Metric Interval Linear Logic), as well as non-zenoness and deadlock-freedom....

2007
Thomas Brihaye François Laroussinie Nicolas Markey Ghassan Oreiby

We propose a new model for timed games, based on concurrent game structures (CGSs). Compared to the classical timed game automata of Asarin et al. [8], our timed CGSs are “more concurrent”, in the sense that they always allow all the agents to act on the system, independently of the delay they want to elapse before their action. Timed CGSs weaken the “element of surprise” of timed game automata...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید