One of the most successful techniques for automatic verification is that of model checking. For finite automata there exist since long extremely efficient model–checking algorithms, and in the last few years these algorithms have been made applicable to the verification of real–time automata using the region–techniques of Alur and Dill. In this paper, we continue this transfer of existing techn...

Abstract A growing body of literature suggests that the world's languages can be classified into three rhythm classes: mora-timed languages, stress-timed and syllable-timed languages. However, scholars cannot agree on which rhythmic measures discriminate classes most satisfactorily whether speech rate factor should considered. In this study, we analyze production by bilingual speakers, compare ...

Adding real time information to Petri net models often leads to undecidability of classical verification problems such as reachability and boundedness. For instance, models such as Timed-Transition Petri nets (TPNs) [22] are intractable except in a bounded setting. On the other hand, the model of TimedArc Petri nets [26] enjoys decidability results for boundedness and control-state reachability...

In order to better characterize the performance of trapped ion systems and ease experimental difficulties addressing individual ions, authors apply carefully-timed pulse sequences chains up 51 ions long. These techniques allow them generate entanglement between all neighboring pairs quantify mitigate sources decoherence in chains.