130 search results - page 8 / 26 » Decidability Problems of a Basic Class of Object Nets |
IGPL
2006
13 years 7 months ago
2006
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...
SERP
2003
13 years 9 months ago
2003
The role that design by contract plays in the specification, monitoring, and reuse of classes is of increasing importance in the OO community. Although recognizably useful, neverth...
ENTCS
2006
13 years 7 months ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
ICIAP
2003
ACM
14 years 24 days ago
2003
ACM
Object recognition, i. e. classification of objects into one of several known object classes, generally is a difficult task. In this paper we address the problem of detecting an...
ENTCS
2000
13 years 7 months ago
2000
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...