Sciweavers

1073 search results - page 49 / 215
» Reasoning about Continuous Processes
Sort
View
CONCUR
2000
Springer
14 years 2 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii
ENTCS
2006
127views more  ENTCS 2006»
13 years 10 months ago
Capability-Passing Processes
Capability passing processes model global applications in a way that decouples the global agreement aspects of protocols from the details of how the communications are actually ma...
Tom Chothia, Dominic Duggan
JAIR
2008
138views more  JAIR 2008»
13 years 10 months ago
Networks of Influence Diagrams: A Formalism for Representing Agents' Beliefs and Decision-Making Processes
This paper presents Networks of Influence Diagrams (NID), a compact, natural and highly expressive language for reasoning about agents' beliefs and decision-making processes....
Ya'akov Gal, Avi Pfeffer
SEMWEB
2007
Springer
14 years 4 months ago
From Web Directories to Ontologies: Natural Language Processing Challenges
Hierarchical classifications are used pervasively by humans as a means to organize their data and knowledge about the world. One of their main advantages is that natural language ...
Ilya Zaihrayeu, Lei Sun, Fausto Giunchiglia, Wei P...
CAV
2008
Springer
130views Hardware» more  CAV 2008»
13 years 12 months ago
A Hybrid Type System for Lock-Freedom of Mobile Processes
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
Naoki Kobayashi, Davide Sangiorgi