We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
There is current interest in generalizing Bayesian networks by using dependencies which are more general than probabilistic conditional independence (CI). Contextual dependencies, ...
In our research we are developing methodologiesand tools to permit stochastic analyses of CSP-based system specifications. In this regard, we have been developing morphismsbetween...
Krishna M. Kavi, Frederick T. Sheldon, Behrooz Shi...
: We give the main definitions and results of a new framework for algebraic specifications: the framework of label algebras. The main idea underlying our approach is that the sem...
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...