Representations of Petri Net Interactions

@inproceedings{Sobocinski2010RepresentationsOP,
  title={Representations of Petri Net Interactions},
  author={P. Sobocinski},
  booktitle={CONCUR},
  year={2010}
}
We introduce a novel compositional algebra of Petri nets, as well as a stateful extension of the calculus of connectors. These two formalisms are shown to have the same expressive power. 
Reachability via Compositionality in Petri nets
TLDR
A novel technique for checking reachability in Petri nets that relies on a recently introduced compositional algebra of nets, and it is proved that the technique is correct, and the implementation is discussed. Expand
From Hierarchical BIP to Petri Calculus
We focus on Hierarchical BIP, an extension of Joseph Sifakis et al’s BIP component framework, to provide a semantics-preserving, compositional encoding in the Petri calculus, a recently proposedExpand
A Programming Language for Spatial Distribution of Net Systems
TLDR
This work shows how an algebraic decomposition allows one to expose both concurrency and spatial distribution in the statespace in Petri nets. Expand
Nets, Relations and Linking Diagrams
TLDR
Composition of nets without places is characterised as the composition of spans over appropriate categories of relations, and the underlying algebraic structures of Petri nets are studied. Expand
Compositional Reachability in Petri Nets
We introduce a divide-and-conquer algorithm for a modified version of the reachability/coverability problem in 1-bounded Petri nets that relies on the compositional algebra of nets with boundaries:Expand
Penrose: Putting Compositionality to Work for Petri Net Reachability
TLDR
A tool that uses this technique for reachability checking in Petri Nets, Penrose, is introduced and some design details in its implementation are discussed, and potential future improvements are identified. Expand
Decomposing Petri nets
TLDR
The technique for reachability checking in 1-bounded Petri nets, based on wiring decompositions, is extended to the full algebra and the related structural property of decomposition width on directed hypergraphs is introduced. Expand
WiCcA : LTS Generation Tool for Wire Calculus
We introduce the WIre CalCulus Application (WICCA ), a tool for generating and operating on labelled transition systems (LTS) that result from wire-calculus specifications. The theory behind WICCA isExpand
A Connector Algebra for P/T Nets Interactions
TLDR
This paper shows how the tile model can be used to extend Sobocinski's approach to deal with P/T nets, thus paving the way towards more expressive connector models. Expand
Connector Algebras, Petri Nets, and BIP
TLDR
It is shown that Sobocinski's nets with boundaries are as expressive as Sifakis et al.'s BI(P), the BIP component framework without priorities and a basic algebra of connectors for BI(B) is provided by exploiting Montanari et al.'s tile model and a recent correspondence result withnets with boundaries. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 53 REFERENCES
The box calculus: a new causal algebra with multi-label communication
A new Petri net calculus called the calculus of Petri Boxes is described. It has been designed to allow reasoning about the structure of a net and about the relationship between nets, and toExpand
A Petri Net Semantics for pi-Calculus
TLDR
A distributed semantics for π-calculus, based on P/T Petri nets with inhibitor arcs, is presented and the latter is compared with recent proposals appeared in the literature. Expand
A Petri Net Semantics for -calculus ?
A distributed semantics for-calculus, based on P/T Petri nets with inhibitor arcs, is presented. This net semantics is sound w.r.t. the original early transition system semantics: the interleavingExpand
Operational semantics for Petri net components
TLDR
A calculus for marked labelled nets (components), with places and transitions as atoms and merge, addition, fusion and relabelling as operators, with both state-oriented and event-oriented properties of components can be expressed. Expand
CCS and Petri Nets
  • U. Goltz
  • Computer Science
  • Semantics of Systems of Concurrent Processes
  • 1990
TLDR
This paper gives an introduction to Petri net semantics for CCS, a compositional approach where semantic operations are defined for Petri nets explicitly, and an operational approach using Plotkin-style transition rules which is particularly convenient for infinite processes. Expand
Petri Net Models for Algebraic Theories of Concurrency
TLDR
The issue of interleaving semantics versus True concurrency in an algebraic setting is discussed. Expand
Characterizing Behavioural Congruences for Petri Nets
TLDR
This work exploits a notion of interface for Petri nets in order to design a set of net combinators, characterize such congruences via universal contexts and via games, providing in such a way an understanding of their discerning powers. Expand
Compositional Modeling of Reactive Systems Using Open Nets
TLDR
This work defines a truly concurrent semantics for open nets by extending the Goltz-Reisig process semantics of Petri nets, and introduces a composition operation over open nets, characterized as a pushout in the corresponding category, suitable to model both interaction through open places and synchronization of transitions. Expand
Bigraphs for Petri Nets
  • R. Milner
  • Computer Science, Mathematics
  • Lectures on Concurrency and Petri Nets
  • 2003
A simple example is given of the use of bigraphical reactive systems (BRSs). It provides a behavioural semantics for condition-event Petri nets whose interfaces are named condition nodes, using aExpand
Implementing Condition/Event Nets in the Circal Process Algebra
TLDR
A translation from Condition/Event nets to thecircal process algebra exploits the Circal feature of allowing the simultaneous occurrence of distinct actions to give Condition/ event nets a semantics based on true concurrency, in addition to the interleaving-based semantics. Expand
...
1
2
3
4
5
...