Sciweavers

1643 search results - page 207 / 329
» Consistability: Describing Usually Consistent Systems
Sort
View
IANDC
2006
121views more  IANDC 2006»
14 years 10 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
ICCS
2001
Springer
15 years 3 months ago
Inclusion-Based Approximate Reasoning
Nowadays, people start to accept fuzzy rule–based systems as flexible and convenient tools to solve a myriad of ill–defined but otherwise (for humans) straightforward tasks s...
Chris Cornelis, Etienne E. Kerre
TACS
1994
Springer
15 years 2 months ago
A Semantic Theory for Concurrent ML
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
Dominique Bolignano, Mourad Debbabi
KI
2008
Springer
14 years 10 months ago
Wayfinding in Scene Space
Many environments in which humans wayfind can be conveniently abstracted as networks or graphs: structures of nodes that are interconnected by edges. Examples include the street ne...
Urs-Jakob Rüetschi
CACM
1999
113views more  CACM 1999»
14 years 10 months ago
Object-oriented Abstractions for Distributed Programming
ion suffices ("decide which type you want and provide a full set of operations for each type"). If the application domain is, say, the administration of a university, the...
Rachid Guerraoui, Mohamed Fayad