Theoretical Computer Science
6th IFIP TC 1/WG 2.2 International Conference, TCS 2010, Held as Part of WCC 2010, Brisbane, Australia, September 20-23, 2010. Proceedings
Chapter and Conference Paper
This work introduces the notion of descriptive ty**. Type systems are typically prescriptive in the sense that they prescribe a space of permitted programs. In contrast, descriptive types assigned to resourc...
Book and Conference Proceedings
6th IFIP TC 1/WG 2.2 International Conference, TCS 2010, Held as Part of WCC 2010, Brisbane, Australia, September 20-23, 2010. Proceedings
Chapter and Conference Paper
A syntactic framework called SGSOS, for defining well-behaved Markovian stochastic transition systems, is introduced by analogy to the GSOS congruence format for nondeterministic processes. Stochastic bisimila...
Chapter and Conference Paper
We use the framework of biorthogonality to introduce a novel semantic definition of the concept of barb (basic observable) for process calculi. We develop a uniform basic theory of barbs and demonstrate its ro...
Book and Conference Proceedings
8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005. Proceedings
Chapter and Conference Paper
G-relative pushouts (GRPOs) have recently been proposed by the authors as a new foundation for Leifer and Milner's approach to deriving labelled bisimulation congruences from reduction systems. This paper deve...
Chapter and Conference Paper
The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious behaviors that must be somewhat f...
Chapter and Conference Paper
Boxed Ambients (BA) replace Mobile Ambients’open capability with communication primitives acting across ambient boundaries. Expressiveness is achieved at the price of communication interferences on message rec...
Chapter and Conference Paper
We provide a novel type system for Bugliesi et al.’s Boxed Ambients that combines value subty** with mobility types. The former is based on read/write exchange types, the latter builds on the notion of ambient ...
Chapter and Conference Paper
We introduce a calculus of Mobile Resources (MR) tailored for the design and analysis of systems containing mobile, possibly nested, computing devices that may have resource and access constraints,an d which are ...
Chapter
We show that the so-called ‘Petri nets are monoids’ approach initiated by Meseguer and Montanari can be extended from ordinary place/transition Petri nets to contextual nets by considering suitable non-free monoi...
Chapter and Conference Paper
We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four classes of nets of increasing expressiv...
Book and Conference Proceedings
7th International Conference Pisa, Italy, August 26–29, 1996 Proceedings
Chapter and Conference Paper
Transition systems with independence and asynchronous transition systems are noninterleaving models for concurrency arising from the same simple idea of decorating transitions with events. They differ for the cho...
Chapter and Conference Paper
The concatenable processes of a Petri net N can be characterized abstractly as the arrows of a symmetric monoidal category P[N]. Yet, this is only a partial axiomatization, since P[N] is built on a concrete, ad h...
Chapter and Conference Paper
We introduce the notion of strongly concatenable process as a refinement of concatenable processes [3] which can be expressed axiomatically via a functor ...
Chapter and Conference Paper
We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising from four simple notions of behaviour, viz...
Chapter and Conference Paper
In the last few years, the sematics of Petri nets has been investigated in several different ways. Apart from the classical “token game”, one can model the behaviour of Petri nets via non-sequential processes,...
Chapter and Conference Paper
Models for concurrency can be classified with respect to the three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice concerning such...
Chapter and Conference Paper
This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models are all proved equivalent in the rathe...