Results 1  10
of
13
A congruence rule format for namepassing process calculi from mathematical structural operational semantics
 In Proc. LICS’06
, 2006
"... We introduce a GSOSlike rule format for namepassing process calculi. Specifications in this format correspond to theories in nominal logic. The intended models of such specifications arise by initiality from a general categorical model theory. For operational semantics given in this rule format, a ..."
Abstract

Cited by 26 (5 self)
 Add to MetaCart
(Show Context)
We introduce a GSOSlike rule format for namepassing process calculi. Specifications in this format correspond to theories in nominal logic. The intended models of such specifications arise by initiality from a general categorical model theory. For operational semantics given in this rule format, a natural behavioural equivalence — a form of open bisimilarity — is a congruence.
A unifying model of variables and names
 Foundations of Software Science and Computational Structures, vol. 3441, Lect. Notes in Comp. Sci
, 2005
"... Abstract. We investigate a category theoretic model where both “variables” and “names”, usually viewed as separate notions, are particular cases of the more general notion of distinction. The key aspect of this model is to consider functors over the category of irreflexive, symmetric finite relation ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We investigate a category theoretic model where both “variables” and “names”, usually viewed as separate notions, are particular cases of the more general notion of distinction. The key aspect of this model is to consider functors over the category of irreflexive, symmetric finite relations. The models previously proposed for the notions of “variables ” and “names ” embed faithfully in the new one, and initial algebra/final coalgebra constructions can be transferred from the formers to the latter. Moreover, the new model admits a definition of distinctionaware simultaneous substitutions. As a substantial application example, we give the first semantic interpretation of MillerTiu’s FOλ ∇ logic. 1
Symmetries, local names and dynamic (de)allocation of names
 Information and Computation
"... The semantics of namepassing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not apt to implementation. Coalgebras over named sets, called historydependent automata, are better suited for the purpose due t ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
The semantics of namepassing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not apt to implementation. Coalgebras over named sets, called historydependent automata, are better suited for the purpose due to locality of names. A theory of behavioural functors for named sets is still lacking: the semantics of each language has been given in an adhoc way, and algorithms were implemented only for the picalculus. Existence of the final coalgebra for the picalculus was never proved. We introduce a language of accessible functors to specify historydependent automata in a modular way, leading to a clean formulation and a generalisation of previous results, and to the proof of existence of a final coalgebra in a wide range of cases. 1
General structural operational semantics through categorical logic (Extended Abstract)
, 2008
"... Certain principles are fundamental to operational semantics, regardless of the languages or idioms involved. Such principles include rulebased definitions and proof techniques for congruence results. We formulate these principles in the general context of categorical logic. From this general formul ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
(Show Context)
Certain principles are fundamental to operational semantics, regardless of the languages or idioms involved. Such principles include rulebased definitions and proof techniques for congruence results. We formulate these principles in the general context of categorical logic. From this general formulation we recover precise results for particular language idioms by interpreting the logic in particular categories. For instance, results for firstorder calculi, such as CCS, arise from considering the general results in the category of sets. Results for languages involving substitution and name generation, such as the πcalculus, arise from considering the general results in categories of sheaves and group actions. As an extended example, we develop a tyft/tyxtlike rule format for open bisimulation in the πcalculus.
A Category of Explicit Fusions
, 2008
"... Name passing calculi are nowadays an established field on its own. Besides their practical relevance, they offered an intriguing challenge, since the standard operational, denotational and logical methods often proved inadequate to reason about these formalisms. A domain which has been successfully ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Name passing calculi are nowadays an established field on its own. Besides their practical relevance, they offered an intriguing challenge, since the standard operational, denotational and logical methods often proved inadequate to reason about these formalisms. A domain which has been successfully employed for languages with asymmetric communication, like the πcalculus, are presheaf categories based on (injective) relabelings, such as Set. Calculi with symmetric binding, in the spirit of the fusion calculus, give rise to new research problems. In this work we examine the calculus of explicit fusions, and propose to model its syntax and semantics using the presheaf category Set E,whereE is the category of equivalence relations and equivalence preserving morphisms.
HDautomata for open bisimulation
"... Abstract. HDautomata are a syntaxindependent operational model introduced for dealing with historydependent formalisms. This kind of enriched automata, where states, transitions, and labels are equipped with names and symmetries, have been successfully applied for modelling early and late bisimul ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. HDautomata are a syntaxindependent operational model introduced for dealing with historydependent formalisms. This kind of enriched automata, where states, transitions, and labels are equipped with names and symmetries, have been successfully applied for modelling early and late bisimulation in πcalculus and hyperbisimulation in Fusion calculus. However, current HDautomata are not adequate for modelling open bisimulation, because in HDautomata two names cannot be unified, while open bisimulation is closed under all possible name substitution respecting name distinctions. In this paper we tackle the problem by integrating in the definition of named sets, the basic building blocks of HDautomata, a notion of distinction: names can coalesce if the distinction allows to. Then, we use HDautomata over named sets with distinctions for modelling the open bisimulation of πcalculus. Finally, we discuss the relationship between named sets with distinctions and their HDautomata, with the categorical counterparts based on presheaf categories. 1
Ministry of University and Research project SisteR (PRIN 20088HXMYN).
, 2011
"... Abstract Name passing calculi are nowadays one of the preferred formalisms for the specification of concurrent and distributed systems with a dynamically evolving topology. Despite their widespread adoption as a theoretical tool, though, they still face some unresolved semantic issues, since the sta ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract Name passing calculi are nowadays one of the preferred formalisms for the specification of concurrent and distributed systems with a dynamically evolving topology. Despite their widespread adoption as a theoretical tool, though, they still face some unresolved semantic issues, since the standard operational, denotational and logical methods often proved inadequate to reason about these formalisms. A domain which has been successfully employed for languages with asymmetric communication, like the πcalculus, are presheaf categories based on (injective) relabellings, such as Set I.Calculiwithsymmetric binding, in the spirit of the fusion calculus, give rise to novel research challenges. In this work we examine the explicit fusion This work was carried out during the first author’s tenure of an ERCIM “Alain Bensoussan” Fellowship Programme. The third author has been supported by the Comunidad de Madrid program ProMeSaS (S0505/TIC/0407) and by the Netherlands Organization for Scientific
A class of automata for the verification of infinite, resourceallocating behaviours???
"... Abstract. Process calculi for serviceoriented computing often feature generation of fresh resources. Socalled nominal automata have been studied both as semantic models for such calculi, and as acceptors of languages of finite words over infinite alphabets. In this paper we investigate nominal au ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Process calculi for serviceoriented computing often feature generation of fresh resources. Socalled nominal automata have been studied both as semantic models for such calculi, and as acceptors of languages of finite words over infinite alphabets. In this paper we investigate nominal automata that accept infinite words. These automata are a generalisation of deterministic Muller automata to the setting of nominal sets. We prove decidability of complement, union, intersection, emptiness and equivalence, and determinacy by ultimately periodic words. The key to obtain such results is to use finite representations of the (otherwise infinitestate) defined class of automata. The definition of such operations enables model checking of process calculi featuring infinite behaviours, and resource allocation, to be implemented using classical automatatheoretic methods. 1
www.elsevier.com/locate/jlap A compositional coalgebraic model of fusion calculus �
"... This paper is a further step in exploring the labelled transitions and bisimulations of fusion calculi. We follow a recent theory by the same authors and previously applied to the picalculus for lifting calculi with structural axioms to bialgebras and, thus, we provide a compositional model of the ..."
Abstract
 Add to MetaCart
(Show Context)
This paper is a further step in exploring the labelled transitions and bisimulations of fusion calculi. We follow a recent theory by the same authors and previously applied to the picalculus for lifting calculi with structural axioms to bialgebras and, thus, we provide a compositional model of the fusion calculus with explicit fusions. In such a model, the bisimilarity relation induced by the unique morphism to the final coalgebra coincides with fusion hyperequivalence and it is a congruence with respect to the operations of the calculus. The key novelty in our work is that we give an account of explicit fusions through labelled transitions. Interestingly enough, this approach allows to exploit for the fusion calculus essentially the same algebraic structure used for the picalculus.