Petri Net Algebra

Best, Eike; Devillers, Raymond; Koutny, Maciej

doi:10.1007/978-3-662-04457-5

Cited by 120 publications

(122 citation statements)

References 0 publications

Supporting

Mentioning

113

Contrasting

Order By: Relevance

“…π-calculus is suitable for describing software system with an evolving communication topology. π-calculus can specify and reason about the design of complex concurrent computing systems by means of algebraic operators corresponding to common programming constructs Best et al (2001). However,the processes of π-calculus are complicated, and it cannot visually model the system architecture (Jiang, 2003).…”

Section: The Integration Of Petri Nets and π-Calculusmentioning

confidence: 99%

Modeling and Analyzing Software Architecture Using Object-Oriented Petri Nets and Pi-Calculus

Yu¹,

Xiao²,

Yu³

et al. 2010

Petri Nets Applications

View full text Add to dashboard Cite

Section: The Integration Of Petri Nets and π-Calculusmentioning

confidence: 99%

Modeling and Analyzing Software Architecture Using Object-Oriented Petri Nets and Pi-Calculus

Yu¹,

Xiao²,

Yu³

et al. 2010

Petri Nets Applications

View full text Add to dashboard Cite

“…H2 The encapsulated TPN is 1-bounded (cf. safe nets in [7]). H2 is called the "safe marking" property.…”

Section: Ime) Is a Labeling Function Which Labels Each Transition In mentioning

confidence: 99%

“…The major theoretical study on taking advantage of both Petri nets and process algebras is presented in [7]. The proposed solution is Petri Box Calculus (PBC), a generic model that embodies both process algebra and Petri nets.…”

Section: Untimed Modelsmentioning

confidence: 99%

See 1 more Smart Citation

Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets

Sadani

Boyer

Saqui-Sannes

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The paper describes a transformational approach for the specification and formal verification of concurrent and real-time systems. At upper level, one system is specified using the timed process algebra RT-LOTOS. The output of the proposed transformation is a Time Petri net (TPN). The paper particularly shows how a TPN can be automatically constructed from an RT-LOTOS specification using a compositionally defined mapping. The proof of the translation consistency is sketched in the paper and developed in [1].The RT-LOTOS to TPN translation patterns formalized in the paper are being implemented. in a prototype tool. This enables reusing TPNs verification techniques and tools for the profit of RT-LOTOS.

show abstract

“…In the context of Petri nets, composition has been studied both from theoretical and practical points of view. The process algebra approach has been investigated by several works leading to the Petri net algebra [3]. Such an approach is closely related to synchronous composition.…”

Section: Introductionmentioning

confidence: 99%

Channel Properties of Asynchronously Composed Petri Nets

Haddad

Hennicker

Møller

2013

Application and Theory of Petri Nets and Concurrency

View full text Add to dashboard Cite

Abstract. We consider asynchronously composed I/O-Petri nets (AIOPNs) with built-in communication channels. They are equipped with a compositional semantics in terms of asynchronous I/O-transition systems (AIOTSs) admitting infinite state spaces. We study various channel properties that deal with the production and consumption of messages exchanged via the communication channels and establish useful relationships between them. In order to support incremental design we show that the channel properties considered in this work are preserved by asynchronous composition, i.e. they are compositional. As a crucial result we prove that the channel properties are decidable for AIOPNs.

show abstract

Petri Net Algebra

Abstract: Softcover reprint of the hardco ver Ist edition 200 I The use of general descriptive names, trademarks, etc. in this publication does not imply,even in the absence of a specific statement, that such names are exempt from the relevant protective laws and therefore free for general use.

Cited by 120 publications

References 0 publications

Modeling and Analyzing Software Architecture Using Object-Oriented Petri Nets and Pi-Calculus

Modeling and Analyzing Software Architecture Using Object-Oriented Petri Nets and Pi-Calculus

Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets

Channel Properties of Asynchronously Composed Petri Nets

Contact Info

Product

Resources

About