Results 1 
6 of
6
Optimal Purely Functional Priority Queues
 JOURNAL OF FUNCTIONAL PROGRAMMING
, 1996
"... Brodal recently introduced the first implementation of imperative priority queues to support findMin, insert, and meld in O(1) worstcase time, and deleteMin in O(log n) worstcase time. These bounds are asymptotically optimal among all comparisonbased priority queues. In this paper, we adapt B ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
Brodal recently introduced the first implementation of imperative priority queues to support findMin, insert, and meld in O(1) worstcase time, and deleteMin in O(log n) worstcase time. These bounds are asymptotically optimal among all comparisonbased priority queues. In this paper, we adapt Brodal's data structure to a purely functional setting. In doing so, we both simplify the data structure and clarify its relationship to the binomial queues of Vuillemin, which support all four operations in O(log n) time. Specifically, we derive our implementation from binomial queues in three steps: first, we reduce the running time of insert to O(1) by eliminating the possibility of cascading links; second, we reduce the running time of findMin to O(1) by adding a global root to hold the minimum element; and finally, we reduce the running time of meld to O(1) by allowing priority queues to contain other priority queues. Each of these steps is expressed using MLstyle functors. The last transformation, known as datastructural bootstrapping, is an interesting application of higherorder functors and recursive structures.
Objects as Mobile Processes
 RESEARCH SERIES RS9638, BRICS
, 1996
"... The object calculus of Abadi and Cardelli [AC96, AC94b, AC94a] is intended as model of central aspects of objectoriented programming languages. In this paper we encode the object calculus in the asynchronous picalculus without matching and investigate the properties of our encoding. ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
The object calculus of Abadi and Cardelli [AC96, AC94b, AC94a] is intended as model of central aspects of objectoriented programming languages. In this paper we encode the object calculus in the asynchronous picalculus without matching and investigate the properties of our encoding.
Trueconcurrency probabilistic models Branching cells and distributed probabilities for event structures
, 2006
"... ..."
Probabilistic trueconcurrency models: branching cells and distributed probabilities, in "Information and Computation
, 2006
"... This paper is devoted to trueconcurrency models for probabilistic systems. By this we mean probabilistic models in which Mazurkiewicz traces, not interleavings, are given a probability. Here we address probabilistic event structures. We consider a new class of event structures, called locally finit ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
This paper is devoted to trueconcurrency models for probabilistic systems. By this we mean probabilistic models in which Mazurkiewicz traces, not interleavings, are given a probability. Here we address probabilistic event structures. We consider a new class of event structures, called locally finite. Locally finite event structures exhibit “finite confusion”; in particular, under some mild condition, confusionfree event structures are locally finite. In locally finite event structures, maximal configurations can be tiled with branching cells: branching cells are minimal and finite substructures capturing the choices performed while scanning a maximal configuration. A probabilistic event structure (p.e.s.) is a pair (E, P), where E is a prime event structure and P is a probability on the space of maximal configurations of E. We introduce the new class of distributed probabilities for p.e.s.: distributed probabilities are such that random choices in
J.C.: Modelchecking games for fixpoint logics with partial order models
 In: Proceedings of CONCUR’09. Volume 5710 of LNCS
, 2009
"... Abstract. We introduce modelchecking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played. Since the onestep interleaving semantics of such models is not considered, some problems that may arise when using int ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We introduce modelchecking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played. Since the onestep interleaving semantics of such models is not considered, some problems that may arise when using interleaving semantics are avoided and new decidability results for partial orders are achieved. The games are shown to be sound and complete, and therefore determined. While in the interleaving case they coincide with the local modelchecking games for the µcalculus, Lµ, in a noninterleaving setting they verify properties of Separation Fixpoint Logic (SFL), a logic that can specify in partial orders properties not expressible with Lµ. The games underpin a novel decision procedure for modelchecking all temporal properties of a class of infinite and regular event structures, thus improving previous results in the literature. Keywords: Modal and temporal logics; Modelchecking games; Hintikka game semantics; Partial order models of concurrency; Process algebras. 1
Kleene theorems for product systems
"... We prove Kleene theorems for two subclasses of labelled product systems which are inspired from wellstudied subclasses of 1bounded Petri nets. For product Tsystems we define a corresponding class of expressions. The algorithms from systems to expressions and in the reverse direction are both pol ..."
Abstract
 Add to MetaCart
(Show Context)
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from wellstudied subclasses of 1bounded Petri nets. For product Tsystems we define a corresponding class of expressions. The algorithms from systems to expressions and in the reverse direction are both polynomial time. For product free choice systems with a restriction of structural cyclicity, that is, the initial global state is a feedback vertex set, going from systems to expressions is still polynomial time; in the reverse direction it is polynomial time with access to an NP oracle for finding deadlocks.