Soren Debois - IT University of Copenhagen

Soren Debois
Are you Soren Debois?

Claim your profile, edit publications, add additional information:

Contact Details

Name
Soren Debois
Affiliation
IT University of Copenhagen
City
København
Country
Denmark

Pubs By Year

Pub Categories

 
Computer Science - Software Engineering (2)
 
Computer Science - Logic in Computer Science (2)
 
Computer Science - Networking and Internet Architecture (1)
 
Computer Science - Programming Languages (1)

Publications Authored By Soren Debois

Blockchain technology promises a sizable potential for executing inter-organizational business processes without requiring a central party serving as a single point of trust (and failure). This paper analyzes its impact on business process management (BPM). We structure the discussion using two BPM frameworks, namely the six BPM core capabilities and the BPM lifecycle. Read More

2015Oct
Affiliations: 1IT University of Copenhagen, 2IT University of Copenhagen, 3IT University of Copenhagen, Exformatics A/S, 4Imperial College, London, Department of Computing

We present the first session typing system guaranteeing request-response liveness properties for possibly non-terminating communicating processes. The types augment the branch and select types of the standard binary session types with a set of required responses, indicating that whenever a particular label is selected, a set of other labels, its responses, must eventually also be selected. We prove that these extended types are strictly more expressive than standard session types. Read More

2011Jun
Affiliations: 1IT University of Copenhagen, 2IT University of Copenhagen, 3IT University of Copenhagen

We propose a mechanism for the vertical refinement of bigraphical reactive systems, based upon a mechanism for limiting observations and utilising the underlying categorical structure of bigraphs. We present a motivating example to demonstrate that the proposed notion of refinement is sensible with respect to the theory of bigraphical reactive systems; and we propose a sufficient condition for guaranteeing the existence of a safety-preserving vertical refinement. We postulate the existence of a complimentary notion of horizontal refinement for bigraphical agents, and finally we discuss the connection of this work to the general refinement of Reeves and Streader. Read More

We investigate a graphical representation of session invocation interdependency in order to prove progress for the pi-calculus with sessions under the usual session typing discipline. We show that those processes whose associated dependency graph is acyclic can be brought to reduce. We call such processes transparent processes. Read More