132 search results - page 21 / 27 » Process Equivalences as Global Bisimulations |
ACSD
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
ACIVS
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...
SSDBM
2002
IEEE
14 years 22 days ago
2002
IEEE
This paper presents an approach to answering queries over an ontology modelled using a description logic. The ontology acts as a global schema, providing a declarative description...
ACTA
2007
13 years 8 months ago
2007
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular ...
FM
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...