20126 search results - page 150 / 4026 » Timed Transition Systems |
167
Voted
CONCUR
2003
Springer
15 years 8 months ago
2003
Springer
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
136
Voted
CAV
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
139
Voted
ACSD
2001
IEEE
15 years 7 months ago
2001
IEEE
This paper describes a new way of testing reactive systems as investigated by the RATE-project at the Tampere University of Technology. We abandon the idea of systematically using...
116
Voted
LMCS
2007
15 years 3 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
93
Voted
CHI
2002
ACM
16 years 3 months ago
2002
ACM
Two experiments investigated the effects of system response time (SRT) on hypertext navigation. Dependent variables were residence time, emotional strain and memory performance. A...