We describe a prototype tool, hugo/RT, that is designed to automatically verify whether the timed state machines in a UML model interact according to scenarios specified by time-annotated UML collaborations. Timed state machines are compiled into timed automata that exchange signals and operations via a network automaton. A collaboration with time constraints is translated into an observer time...

A study was conducted to determine if early weaning spring born calves can be an alternative management strategy during drought and if early weaning facilitates rebreeding of young cows. Our objectives were to determine effects of early weaning at the start of breeding on cow body weight, body condition score, and reproductive performance with or without estrous synchronization and AI in two he...

In this paper we present a timed extension of the AltaRica language, Timed AltaRica, and describe the architecture of a compiler from Timed AltaRica to timed automata. We present the features of the language, namely modularity, hierarchical modeling and reuse of components during the specification phase, on an avionics example. Then, we use the compiler from Timed AltaRica to Timed Automata to ...

In this paper, we provide evidence for rhythmic classifications of speech from duration measurements. Our investigation differs from previous studies in two ways. Firstly, we do not relate speech rhythm to phonological units such as interstress intervals or syllable durations. Instead, we calculate durational variability in successive acoustic-phonetic intervals using Pairwise Variability Indic...

Timing aspects in formalisms with explicit resources and parallelism are investigated, and it is presented a formal link between timed membrane systems and timed Petri nets with localities. For both formalisms, timing does not increase the expressive power; however both timed membrane systems and timed Petri nets are more flexible in describing molecular phenomena where time is a critical resou...

We provide a unifying view of timed models such as timed automata, probabilistic timed automata, and Markov automata. The timed models and their bisimulation semantics are encoded in the framework of uniform labeled transition systems. In this unifying framework, we show that the timed bisimilarities present in the literature can be reobtained and that a new bisimilarity, of which we exhibit th...