The key notion for modelling calendar systems and many other periodic temporal notion is the mathematical concept of a partitioning of the real numbers. A partitioning of R splits ...
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
This paper introduces “micro-scalability” as a novel design objective for social reasoning architectures operating in open multiagent systems. Microscalability is based on the ...
We suggest a general paradigm of using large-scale distributed computation to solve difficult problems, but where humans can act as agents and provide candidate solutions. We are e...
Craig Gentry, Zulfikar Ramzan, Stuart G. Stubblebi...
Abstract. In formal testing, the assumption of input enabling is typically made. This assumption requires all inputs to be enabled anytime. In addition, the useful concept of quies...