This paper demonstrates how three stochastic process algebras can be mapped on to a generally-distributed stochastic transition system. We demonstrate an aggregation technique on ...
In this paper we investigate timed polyhedra, i.e. polyhedra which are finite unions of full dimensional simplices of a special kind. Such polyhedra form the basis of timing analys...
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
Abstract. We extend the algebraic approach of Meseguer and Montanari from ordinary place/transition Petri nets to contextual nets, covering both the collective and the individual t...
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...