Abstract. Traditional branching-time logics such as CTL ⋆ are memoryless: once a path in the computation tree is quantified at a given node, the computation that led to that node is forgotten. Recent work in planing suggests that CTL ⋆ cannot easily express temporal goals that refer to whole

. This paper develops an approach to branching-time probabilistic model checking that is based on quantifying the likelihood with which a system satisfies a formula in the traditional mu-calculus. The semantics uniformly extends the standard interpretation of the mu-calculus and also subsumes

Abstract. Formal methods are used to increase the reliability of soft-ware and hardware systems. Methods such as model checking, verifi-cation and testing are used to search for design and coding errors, in-tegrated in the process of system design. Beyond checking whether a system satisfies a

is permitted for educational or research use on condition that this copyright notice is included in any copy. Publications in the FI MU Report Series are in general accessible via WWW: Further information can obtained by contacting:

Abstract This paper presents a probabilistic semantics for the alternation-free modalmu-calculus. This semantics precisely defines the probability with which a system that includes a mixture of probabilistic and nondeterministic choicessatisfies a formula in the logic. An algorithm for computing

this paper various semantics in the linear time -- branching time spectrum are presented in a uniform, model-independent way. Restricted to the class of finitely branching, concrete, sequential processes, only fifteen of them turn out to be different, and most semantics found in the literature

We consider stochastic turn-based games where the winning objectives are given by formulae of the branching-time logic PCTL. These games are generally not determined and winning strategies may require memory and/or randomization. Our main results concern history-dependent strategies. In particular

We consider stochastic turn-based games where the winning objectives are given by formulae of the branching-time logic PCTL. These games are generally not determined and win-ning strategies may require memory and/or randomization. Our main results concern history-dependent strategies. In particular

Abstract not found

the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n