Sciweavers

112 search results - page 21 / 23
» Two Algebraic Process Semantics for Contextual Nets
Sort
View
ICCBR
2001
Springer
14 years 3 days ago
A Case-Based Reasoning View of Automated Collaborative Filtering
From some perspectives Automated Collaborative Filtering (ACF) appears quite similar to Case-Based Reasoning (CBR). It works on data organised around users and assets that might be...
Conor Hayes, Padraig Cunningham, Barry Smyth
IEEESCC
2005
IEEE
14 years 1 months ago
Web Services Composition: A Story of Models, Automata, and Logics
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
Richard Hull
SIGSOFT
1998
ACM
13 years 12 months ago
Reasoning about Implicit Invocation
Implicit invocation SN92, GN91] has become an important architectural style for large-scale system design and evolution. This paper addresses the lack of speci cation and veri cat...
David Garlan, Somesh Jha, David Notkin
CATS
2008
13 years 9 months ago
Weak Parametric Failure Equivalences and Their Congruence Formats
Weak equivalences are important behavioral equivalences in the course of specifying and analyzing the reactive systems using process algebraic languages. In this paper, we propose...
Xiaowei Huang, Li Jiao, Weiming Lu
TCS
2010
13 years 2 months ago
Combinatorics of labelling in higher-dimensional automata
The main idea for interpreting concurrent processes as labelled precubical sets is that a given set of n actions running concurrently must be assembled to a labelled ncube, in exac...
Philippe Gaucher