We propose the πD -calculus, a process calculus that can flexibly model fine-grained control of resource access in distributed computation, with a type system that statically pr...
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
State machines consume and process actions complementary to programs issuing actions. State machines maintain a state and reply with a boolean response to each action in their int...
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...