Sciweavers

921 search results - page 110 / 185
» On Interleaving in Timed Automata
Sort
View
JALC
2007
90views more  JALC 2007»
14 years 11 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
ISSRE
2010
IEEE
14 years 10 months ago
Automata-Based Verification of Security Requirements of Composite Web Services
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
Hongyu Sun, Samik Basu, Vasant Honavar, Robyn R. L...
BCSHCI
2007
15 years 1 months ago
An empirical investigation into dual-task trade-offs while driving and dialing
Engaging in a secondary task, such as dialing a cell phone, while driving a car has been found to have a deleterious effect on driver performance. A point often overlooked though ...
Duncan P. Brumby, Dario D. Salvucci, Andrew Howes
QEST
2010
IEEE
14 years 9 months ago
Timed Branching Processes
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
Ashutosh Trivedi, Dominik Wojtczak
RTSS
2008
IEEE
15 years 6 months ago
A Multi-mode Real-Time Calculus
The Real-Time Calculus (RTC) framework proposed in [Chakraborty et al., DATE 2003] and subsequently extended in [Wandeler et al., Real-Time Systems 29(2-3), 2005] and a number of ...
Linh T. X. Phan, Samarjit Chakraborty, P. S. Thiag...