7 Result(s)
within
Vladimiro Sassone
Programming Languages, Compilers, Interpreters
-
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
A Dependently Typed Ambient Calculus
The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to enforce elementary access cont...
-
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
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
Open Ended Systems, Dynamic Bisimulation and Tile Logic
The sos formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to characterize the coarsest congruence for...
-
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 ...
