305 search results - page 15 / 61 » Decidability of Split Equivalence |
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 (...
ICDT
2007
ACM
14 years 1 months ago
2007
ACM
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
PKC
1999
Springer
13 years 12 months ago
1999
Springer
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
ICWS
2009
IEEE
14 years 4 months ago
2009
IEEE
Deciding on web service equivalence in process-aware service compositions is a crucial challenge throughout the composition life cycle. Restricting such decisions to (activity) la...
JWSR
2011
13 years 2 months ago
2011
: Deciding on web service equivalence in process-aware service compositions is a crucial challenge throughout the composition life cycle. Restricting such decisions to (activity) l...