1,721,182 research outputs found
On the Algebraic Structure of Petri Nets
No full textThis paper retraces, collects, and summarises the contributions of the author --- both individually and in collaboration with others --- on the theme of algebraic, compositional approaches to the semantics of Petri nets
Preface
No full textOverview of the contents of "Foundations of Software Science and Computational Structures: Selected papers from FOSSACS 2005
On the Semantics of Place/Transition Petri Nets
No full textPlace/Transition (PT) Petri 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, even in its more abstract interpretations in terms of nonsequential processes and monoidal categories; on the other hand, Winskel's basic unfolding construction, which provides a coreflection between nets and finitary prime algebraic domains, works only for safe nets. In this paper we extend Winskel's result to PT nets. We start with a rather general category PTNets of PT nets, we introduce a category DecOcc of decorated (nondeterministic) occurrence nets and we define adjunctions between PTNets and DecOcc and between DecOcc and Occ, the category of occurrence nets. The role of DecOcc is to provide natural unfoldings for PT nets, i.e., acyclic safe nets where a notion of family is used for relating multiple instances of the same place. The unfolding functor from PTNets to Occ reduces to Winskel's when restricted to safe nets; moreover, the standard coreflection between Occ and Dom, the category of finitary prime algebraic domains, when composed with the unfolding functor above, determines a chain of adjunctions between PTNets and Dom
The Algebraic Structure of Petri Nets
No full textThis survey retraces, collects, and summarises the contributions of the author --- both individually and in collaboration with others --- on the theme of algebraic, compositional approaches to the semantics of Petri nets
Global Computing II - A new FET Programme for FP6 (talk)
No full textTalk given at FET 2004 Information Day, Brussels 4.06.0
Labels from Reductions - the theory of relative pushouts (talk)
No full textTalk given at CALCO 2005 (3.09.05
Capacity-Bounded Computational Ambients (talk)
No full textTalk give at FOSAD 2002, Bertinoro 25.09.0
Models of Computation: A Tribute to Ugo Montanari’s Vision
Full text linkUgo’s research activity in the area of Models of Computation (MoC, for short) has been prominent, influential and broadly scoped. In this introductory contribution we would like to recall some of the influential MoC models put forward by Ugo which cut across the three approaches
Temporal Constraints for Concurrent Object Synchronisation (talk)
No full textTalk given at WOOD 2003 (12.04.03
- …
