Skip to main content

and
Your search also matched 12 preview-only Content is preview-only when you or your institution have not yet subscribed to it.

By making our abstracts and previews universally accessible we help you purchase only the content that is relevant to you.
results, e.g.

Descriptive Types for Linked Data Resources

Include preview-only content
  1. 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...

    Bartek Klin, Vladimiro Sassone in Foundations of Software Science and Comput… (2008)

  2. 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...

    Cédric Lhoussaine, Vladimiro Sassone in Programming Languages and Systems (2004)

  3. 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...

    Vladimiro Sassone, Paweł Sobociśki in Foundations of Software Science and Comput… (2003)

  4. 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...

    Maria Grazia Buscemi, Vladimiro Sassone in Foundations of Software Science and Comput… (2001)

  5. 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 ...

    Vladimiro Sassone in TAPSOFT '95: Theory and Practice of Software Development (1995)