Browsing Administrative Staff Authors (Scholarly Publications) by Author "HENNESSY, MATTHEW"
Now showing items 1-20 of 41
-
Adding Recursion to Dpi. (Extended Abstract)
(Electronic Notes in Theoretical Computer Science, 2006)Dpi is a distributed version of the pi-calculus, in which processes are explicitly located, and a migration construct may be used for moving between locations. We argue that adding a recursion operator to the language ... -
Assigning Types to Processes
(IEEE Computer Society Press., 2000)In wide area distributed systems it is now common for higher-order code to be transferred from one domain to another; the receiving host may initialise parameters and then execute the code in its local environment. We ... -
Bisimulation Congruences in Safe Ambients (extended abstract).
(2002)We develop a semantics theory for SAP, a variant of Levi and Sangiorgi?s Safe Ambients, SA. The dynamics of SA relies upon capabilities (and co-capabilities) exercised by mobile agents, called ambients, to interact with ... -
A calculus for costed computations
(2011)We develop a version of the picalculus Picost where channels are interpreted as resources which have costs associated with them. Code runs under the financial responsibility of owners; they must pay to use resources, but ... -
Characterising Testing Preorders for Finite Probabilistic Processes
(2007)In 1992 Wang & Larsen extended the may- and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems that have remained open throughout ... -
Communicating Transactions
(Springer, 2010)We propose a novel language construct called communicating transactions, obtained by dropping the isolation requirement from classical transactions, which can be used to model automatic error re- covery in distributed ... -
Compositional Reasoning for Markov Decision Processes
(2011)Markov decision processes (MDPs) have long been used to model qualitative aspects of systems in the presence of uncertainty. However, much of the literature on MDPs takes a monolithic approach, by modelling a system as a ... -
Compositional reasoning for weighted Markov decision processes
(2013)Weighted Markov decision processes (MDPs) have long been used to model quantitative aspects of systems in the presence of uncertainty. However, much of the literature on such MDPs takes a monolithic approach, by modelling ... -
Counting the cost in the picalculus.
(Elsevier Science Publishers B. V, 2009)We design a new variation on the picalculus, ?cost, in which the use of channels or resources must be paid for. Processes operate relative to a cost environment, and communications can only happen if principals have ... -
First-Order Reasoning for Higher-Order Concurrency
(2009)By combining and simplifying two of the most prominent theories for HO! of Sangiorgi et al. and Jeffrey and Rathke [15, 4], we present an effective first-order theory for a higher-order picalculus. There are two significant ... -
A fully abstract denotational model for higher-order processes
(IEEE Computer Society Press, 1993)A higher-order process calculus is defined in which one can describe processes which transmit as messages other processes; it may be viewed as a generalization of the lazy ?-calculus. The authors present a denotational ... -
Inferring dynamic credentials for role-based trust management
(ACM, 2006)The topic of this paper is the role-based trust-management language RT_0, a formalism inspired by logic programming that handles trust in large scale, decentralised systems. We provide a purely operational semantics ... -
Information flow vs resource access in the asynchronous pi-calculus.
(ACM, 2002)We propose an extension of the asynchronous ?-calculus in which a variety of security properties may be captured using types. These are an extension of the input/output types for the ?-calculus in which I/O capabilities ... -
Liveness of Communicating Transactions (Extended Abstract)
(2010)We study liveness and safety in the context of CCS extended with communicating transactions, a construct we recently proposed to model automatic error recovery in distributed systems. We show that fair-testing and ... -
Modelling Mac-Layer communications in wireless systems
(2015)We present a timed process calculus for modelling wireless networks in which individual stations broadcast and receive messages; moreover the broadcasts are subject to collisions. Based on a reduction semantics for the ... -
Modelling MAC-layer communications in wireless systems.
(Trinity College, Dublin, Ireland., 2012)We present a timed process calculus for modelling wireless networks in which individual stations broadcast and receive messages; moreover the broadcasts are subject to collisions. Based on a reduction semantics for the ... -
Modelling probabilistic wireless networks
(2013)We propose a process calculus to model high level wireless systems, where the topology of a network is described by a digraph. The calculus enjoys features which are proper of wireless networks, namely broadcast communication ... -
Modelling session types using contracts
(2011)Session types and contracts are two formalisms used to study client- server protocols. In this paper we study the relationship between them. The main result is the existence of a fully abstract model of session types; this ... -
Mutually testing processes
(2015)This volume contains the proceedings of the 24th Conference on Concurrency Theory (CONCUR 2013) held in Buenos Aires, Argentina, during August 27–30, 2013. CONCUR 2013 was organized by the Universidad de Buenos Aires ...
