Results 1 
9 of
9
Models for NamePassing Processes: Interleaving and Causal
 In Proceedings of LICS 2000: the 15th IEEE Symposium on Logic in Computer Science (Santa Barbara
, 2000
"... We study syntaxfree models for namepassing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support the usual picalculus operations, defining Indexed Labelled Transition Systems. For noninterleaving causal semantics we de ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
We study syntaxfree models for namepassing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support the usual picalculus operations, defining Indexed Labelled Transition Systems. For noninterleaving causal semantics we define Indexed Labelled Asynchronous Transition Systems, smoothly generalizing both our interleaving model and the standard Asynchronous Transition Systems model for CCSlike calculi. In each case we relate a denotational semantics to an operational view, for bisimulation and causal bisimulation respectively. We establish completeness properties of, and adjunctions between, categories of the two models. Alternative indexing structures and possible applications are also discussed. These are first steps towards a uniform understanding of the semantics and operations of namepassing calculi.
An Event Structure Semantics for P/T Contextual Nets: Asymmetric Event Structures
 PROC. FOSSACS98, NIVAT
, 1998
"... We propose an event based semantics for contextual nets, i.e. an extension of Place/Transition Petri nets where transitions can also have context conditions, modelling resources that can be read without being consumed. The result is a generalization of Winskel’s work on safe nets: the event based s ..."
Abstract

Cited by 24 (16 self)
 Add to MetaCart
We propose an event based semantics for contextual nets, i.e. an extension of Place/Transition Petri nets where transitions can also have context conditions, modelling resources that can be read without being consumed. The result is a generalization of Winskel’s work on safe nets: the event based semantics is given at categorical level via a chain of coreflections leading from the category WSCN of weakly safe contextual nets to the category Dom of finitary prime algebraic domains. A fundamental rôle is played by the notion of asymmetric event structures that generalize Winskel’s prime event structures, following an idea similar to that of “possible flow ” introduced by Pinna and Poignè. Asymmetric event structures have the usual causal relation of traditional prime event structures, but replace the symmetric conflict with a relation modelling asymmetric conflict or weak causality. Such relation allows one to represent the new kind of dependency between events arising in contextual nets, as well as the usual symmetric conflict. Moreover it is used in a nontrivial way in the definition of the ordering of configurations, which is different from the standard setinclusion.
A distributed semantics for EMPA based on stochastic contextual nets
 Special Issue: Proc. of 3rd Process Algebra and Performance Modelling Workshop
, 1995
"... ..."
Causality in Membrane Systems
"... Summary. P systems are a biologically inspired model introduced by Gheorghe Păun with the aim of representing the structure and the functioning of the cell. P systems are usually equipped with the maximal parallelism semantics; however, since their introduction, some alternative semantics have been ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Summary. P systems are a biologically inspired model introduced by Gheorghe Păun with the aim of representing the structure and the functioning of the cell. P systems are usually equipped with the maximal parallelism semantics; however, since their introduction, some alternative semantics have been proposed and investigated. We propose a semantics that describes the causal dependencies occurring between the reactions of a P system. We investigate the basic properties that are satisfied by such a semantics. The notion of causality turns out to be quite relevant for biological systems, as it permits to point out which events occurring in a biological pathway are necessary for another event to happen. 1
Towards a causal semantics for Brane Calculi
 What is it About Government that Americans Dislike
, 2007
"... Summary. Brane Calculi are a family of biologically inspired process calculi, proposed in [6] to model the interactions of dynamically nested membranes. We propose a semantics that describes the causal dependencies occurring between the reactions of a system described in Brane Calculi. We investigat ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Summary. Brane Calculi are a family of biologically inspired process calculi, proposed in [6] to model the interactions of dynamically nested membranes. We propose a semantics that describes the causal dependencies occurring between the reactions of a system described in Brane Calculi. We investigate the basic properties that are satisfied by such a semantics. The notion of causality turns out to be quite relevant for biological systems, as it permits to point out which events occurring in a biological pathway are necessary for another event to happen. 1
A Denotational Semantics for the piCalculus
 Fifth Irish Workshop in Formal Methods (IWFM’01
, 2001
"... In his categorical framework, Stark defines a domaintheoretic model for the #calculus based on functor categories. Despite being a sound abstract model, a more concrete semantics is required if it is to be used as a basis for proving properties about mobile systems. In this paper, we concretize St ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In his categorical framework, Stark defines a domaintheoretic model for the #calculus based on functor categories. Despite being a sound abstract model, a more concrete semantics is required if it is to be used as a basis for proving properties about mobile systems. In this paper, we concretize Stark's denotational model for the #calculus and provide a full definition of the semantic domains involved. We also include an example of how the model may be approximated in an abstract interpretation analysis. 1
Concurrency Can’t Be Observed, Asynchronously
"... The paper is devoted to an analysis of the concurrent features of asynchronous systems. A preliminary step is represented by the introduction of a noninterleaving extension of barbed equivalence. This notion is then exploited in order to prove that concurrency cannot be observed through asynchronou ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The paper is devoted to an analysis of the concurrent features of asynchronous systems. A preliminary step is represented by the introduction of a noninterleaving extension of barbed equivalence. This notion is then exploited in order to prove that concurrency cannot be observed through asynchronous interactions, i.e., that the interleaving and concurrent versions of a suitable asynchronous weak equivalence actually coincide. The theory is validated on two case studies, related to nominal calculi (πcalculus) and visual specification formalisms (Petri nets).
Under consideration for publication in Math. Struct. in Comp. Science Concurrency Can’t Be Observed, Asynchronously †
, 2012
"... The paper is devoted to an analysis of the concurrent features of asynchronous systems. A preliminary step is represented by the introduction of a noninterleaving extension of barbed equivalence. This notion is then exploited in order to prove that concurrency cannot be observed through asynchronou ..."
Abstract
 Add to MetaCart
The paper is devoted to an analysis of the concurrent features of asynchronous systems. A preliminary step is represented by the introduction of a noninterleaving extension of barbed equivalence. This notion is then exploited in order to prove that concurrency cannot be observed through asynchronous interactions, i.e., that the interleaving and concurrent versions of a suitable asynchronous weak equivalence actually coincide. The theory is validated on some case studies, related to nominal calculi (πcalculus) and visual specification formalisms (Petri nets). Additionally, we prove that a class of systems which are (outputbuffered) asynchronous according to a characterisation previously proposed in the literature falls into our theory.
Author manuscript, published in "Applications and Theory of Petri Nets, Newcastle: United Kingdom (2011)" DOI: 10.1007/9783642218347_12 A Petri Net Interpretation of Open Reconfigurable Systems
, 2011
"... Abstract. We present a Petri net interpretation of the pigraphs a graphical variant of the picalculus. Characterizing labelled transition systems, the translation can be used to reason in Petri net terms about open reconfigurable systems. We demonstrate that the pigraphs and their translated Pet ..."
Abstract
 Add to MetaCart
Abstract. We present a Petri net interpretation of the pigraphs a graphical variant of the picalculus. Characterizing labelled transition systems, the translation can be used to reason in Petri net terms about open reconfigurable systems. We demonstrate that the pigraphs and their translated Petri nets agree at the semantic level. In consequence, existing results on pigraphs naturally extend to the translated Petri nets, most notably a guarantee of finiteness by construction.