— This paper is concerned with understanding the connection between the existing Internet congestion control algorithms and the optimal control theory. The available resource all...
This paper analyzes the notion of a minimal belief change that incorporates new information. I apply the fundamental decisiontheoretic principle of Pareto-optimality to derive a no...
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
Abstract. The Unifying Theories of Programming underpins the development of Circus, a state-rich process algebra for refinement. We have previously presented a theory of testing fo...
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...