20 Result(s)
within
Chapter
Vladimiro Sassone
Computation by Abstract Devices
-
Chapter and Conference Paper
Descriptive Types for Linked Data Resources
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...
-
Chapter and Conference Paper
Structural Operational Semantics for Stochastic Process Calculi
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
Semantic Barbs and Biorthogonality
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...
-
Chapter and Conference Paper
Deriving Bisimulation Congruences: 2-Categories Vs Precategories
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
Algebraic Theories for Contextual Pre-nets
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
Communication Interference in Mobile Boxed Ambients
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
Ty** and Subty** Mobility in Boxed Ambients*
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
A Calculus of Mobile Resources*
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
Two Algebraic Process Semantics for Contextual Nets
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
High-Level Petri Nets as Type Theories in the Join Calculus
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...
-
Chapter and Conference Paper
Comparing transition systems with independence and asynchronous transition systems
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
Axiomatizing Petri net concatenable processes
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
On the category of Petri net computations
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
Characterizing behavioural congruences for Petri nets
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
On the model of computation of place/transition Petri nets
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
Relationships between models of concurrency
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
Deterministic behavioural models for concurrency
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...
-
Chapter and Conference Paper
A classification of models for concurrency
-
Chapter and Conference Paper
On the semantics of Petri Nets
Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the “token game” is too intensional, eve...
-
Chapter and Conference Paper
CCS dynamic bisimulation is progressing
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not reguire two states reached by bisimilar computations of woc agents to be still woc, e.g. α.τ.β.nil and α.β.nil ...
