scholarly journals Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis

2022 ◽  
Vol 183 (1-2) ◽  
pp. 1-31
Author(s):  
Raymond Devillers
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Composition Operators ◽  
Original System ◽  
Divide And Conquer ◽  
Transition Systems ◽  
Structure Transition ◽  
Labelled Transition Systems ◽  
Speed Up ◽  
Petri Net Synthesis

In order to speed up the synthesis of Petri nets from labelled transition systems, a divide and conquer strategy consists in defining decompositions of labelled transition systems, such that each component is synthesisable iff so is the original system. Then corresponding Petri Net composition operators are searched to combine the solutions of the various components into a solution of the original system. The paper presents two such techniques, which may be combined: products and articulations. They may also be used to structure transition systems, and to analyse the performance of synthesis techniques when applied to such structures.

Target-oriented Petri Net Synthesis

2020 ◽  
Author(s):  
Eike Best ◽  
Raymond Devillers ◽  
Evgeny Erofeev ◽  
Harro Wimmel
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Transition System ◽  
Efficient Synthesis ◽  
Transition Systems ◽  
Np Complete ◽  
Full Class ◽  
Petri Net Synthesis ◽  
Labelled Transition System ◽  
Additional Constraints

When a Petri net is synthesised from a labelled transition system, it is frequently desirable that certain additional constraints are fulfilled. For example, in circuit design, one is often interested in constructing safe Petri nets. Targeting such subclasses of Petri nets is not necessarily computationally more efficient than targeting the whole class. For example, targeting safe nets is known to be NP-complete while targeting the full class of place/transition nets is polynomial, in the size of the transition system. In this paper, several classes of Petri nets are examined, and their suitability for being targeted through efficient synthesis from labelled transition systems is studied and assessed. The focus is on choice-free Petri nets and some of their subclasses. It is described how they can be synthesised efficiently from persistent transition systems, summarising and streamlining in tutorial style some of the authors’ and their groups’ work over the past few years.

Target-oriented Petri Net Synthesis

2020 ◽  
Vol 175 (1-4) ◽  
pp. 97-122
Author(s):  
Eike Best ◽  
Raymond Devillers ◽  
Evgeny Erofeev ◽  
Harro Wimmel
Keyword(s):  
Petri Nets ◽  
Circuit Design ◽  
Petri Net ◽  
Transition System ◽  
Transition Systems ◽  
Np Complete ◽  
Full Class ◽  
Petri Net Synthesis ◽  
Labelled Transition System ◽  
Additional Constraints

When a Petri net is synthesised from a labelled transition system, it is frequently desirable that certain additional constraints are fulfilled. For example, in circuit design, one is often interested in constructing safe Petri nets. Targeting such subclasses of Petri nets is not necessarily computationally more efficient than targeting the whole class. For example, targeting safe nets is known to be NP-complete while targeting the full class of place/transition nets is polynomial, in the size of the transition system. In this paper, several classes of Petri nets are examined, and their suitability for being targeted through efficient synthesis from labelled transition systems is studied and assessed. The focus is on choice-free Petri nets and some of their subclasses. It is described how they can be synthesised efficiently from persistent transition systems, summarising and streamlining in tutorial style some of the authors’ and their groups’ work over the past few years.

PETRI NETS AND STEP TRANSITION SYSTEMS

1992 ◽  
Vol 03 (04) ◽  
pp. 443-478 ◽  
Author(s):  
MADHAVAN MUKUND
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Transition System ◽  
Computing Systems ◽  
Transition Systems ◽  
Labelled Transition Systems ◽  
Natural Sense ◽  
Step Transition ◽  
Operational Behaviour ◽  
Natural Way

Labelled transition systems are a simple yet powerful formalism for describing the operational behaviour of computing systems. They can be extended to model concurrency faithfully by permitting transitions between states to be labelled by a collection of actions, denoting a concurrent step. Petri nets (or Place/Transition nets) give rise to such step transition systems in a natural way—the marking diagram of a Petri net is the canonical transition system associated with it. In this paper, we characterize the class of PN-transition systems, which are precisely those step transition systems generated by Petri nets. We express the correspondence between PN-transition systems and Petri nets in terms of an adjunction between a category of PN-transition systems and a category of Petri nets in which the associated morphisms are behaviour-preserving in a strong and natural sense.

Composition of Functional Petri Nets

2013 ◽  
pp. 404-464 ◽  
Author(s):  
Dmitry A. Zaitsev
Keyword(s):  
Graph Theory ◽  
Petri Nets ◽  
Petri Net ◽  
Ad Hoc ◽  
Fundamental Equation ◽  
Weighted Graph ◽  
Sequential Composition ◽  
Speed Up ◽  
Networking Protocols ◽  
Linear Invariants

Functional Petri nets and subnets are introduced and studied for the purpose of speed-up of Petri nets analysis with algebraic methods. The authors show that any functional subnet may be generated by a composition of minimal functional subnets. They propose two ways to decompose a Petri net: via logical equations solution and with an ad-hoc algorithm, whose complexity is polynomial. Then properties of functional subnets are studied. The authors show that linear invariants of a Petri net may be computed from invariants of its functional subnets; similar results also hold for the fundamental equation of Petri nets. A technique for Petri nets analysis using composition of functional subnets is also introduced and studied. The authors show that composition-based calculation of invariants and solutions of fundamental equation provides a significant speed-up of computations. For an additional speed-up, they propose a sequential composition of functional subnets. Sequential composition is formalised in the terms of graph theory and was named the optimal collapse of a weighted graph. At last, the authors apply the introduced technique to the analysis of Petri net models of such well-known networking protocols as ECMA, TCP, BGP.

scholarly journals Model Checking Coloured Petri Nets - Exploiting Strongly Connected Components

1997 ◽  
Vol 26 (519) ◽  
Author(s):  
Allan Cheng ◽  
Søren Christensen ◽  
Kjeld Høyer Mortensen
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
The State ◽  
Connected Components ◽  
Coloured Petri Nets ◽  
Transition Systems ◽  
Strongly Connected Components ◽  
State Spaces ◽  
Labelled Transition Systems ◽  
Strongly Connected

In this paper we present a CTL-like logic which is interpreted over the state spaces of Coloured Petri Nets. The logic has been designed to express properties of both state and transition information. This is possible because the state spaces are labelled transition systems. We compare the expressiveness of our logic with CTL's. Then, we present a model checking algorithm which for efficiency reasons utilises strongly connected components and formula reduction rules. We present empirical results for non-trivial examples and compare the performance of our algorithm with that of Clarke, Emerson, and Sistla.

scholarly journals Transition System Models for Concurrency

1992 ◽  
Vol 21 (399) ◽  
Author(s):  
Madhavan Mukund
Keyword(s):  
Petri Nets ◽  
Transition System ◽  
Transition Systems ◽  
Labelled Transition Systems ◽  
System Models ◽  
Elementary Transition ◽  
Step Transition ◽  
Sequential Behaviour

<p>Labelled transition systems can be extended to faithfully model concurrency by permitting transitions between states to be labelled by a collection of actions, denoting a concurrent step, We can characterize a subclass of these <em>step transition systems</em>, called PN-transition systems, which describe the behaviour of Petri nets.</p><p>This correspondence is formally described in terms of a coreflection between a category of <em>PN</em>-transition systems and a category of Petri nets.</p><p>In this paper, we show that we can define subcategories of <em>PN</em>-transition systems whose objects are <em> safe PN-transition systems and elementary PN-transition systems</em> such that there is a coreflection between these subcategories and subcategories of our category of Petri nets corresponding to safe nets and elementary net systems.</p><p>We also prove that our category of elementary <em>PN</em>-transition systems is equivalent to the category of (sequential) <em> elementary transition systems</em> defined by Nielsen, Rozenberg and Thiagarajan, thereby establishing that the concurrent behaviour of an elementary net system can be completely recovered from a description of its sequential behaviour. Finally, we establish a coreflection between our category of safe <em>PN</em>-transition system and a subcategory of <em>asynchronous transition systems</em> which has been shown by Winskel and Nielsen to be closely linked to safe nets.</p>

scholarly journals A Comparison of Petri Net Semantics under the Collective Token Philosophy

1998 ◽  
Vol 5 (17) ◽  
Author(s):  
Roberto Bruni ◽  
José Meseguer ◽  
Ugo Montanari ◽  
Vladimiro Sassone
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Equational Logic ◽  
Monoidal Categories ◽  
Transition Systems ◽  
Logical Description ◽  
Membership Equational Logic

In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities between three such models, namely configuration structures, concurrent transition systems, and (strictly) symmetric (strict) monoidal categories. We use the notion of adjunction to express each connection. We also present a purely logical description of the collective token interpretation of net behaviours in terms of theories and theory morphisms in partial membership equational logic.

scholarly journals On the Power of Labels in Transition Systems

2001 ◽  
Vol 8 (19) ◽  
Author(s):  
Jirí Srba
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
Transition Systems ◽  
Labelled Transition Systems ◽  
Pushdown Automata ◽  
General Reduction

In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled transition systems to unlabelled ones, preserving bisimilarity and satisfiability of mu-calculus formulas. We apply the reduction to the class of transition systems generated by Petri nets and pushdown automata, and obtain several decidability/complexity corollaries for unlabelled systems. Probably the most interesting result is undecidability of strong bisimilarity for unlabelled Petri nets.

Liveness and boundedness analysis of Petri net synthesis

2014 ◽  
Vol 24 (5) ◽  
Author(s):  
CHUANLIANG XIA
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Flexible Manufacturing ◽  
Manufacturing System ◽  
Flexible Manufacturing System ◽  
Dynamic Properties ◽  
Synthesis Method ◽  
Sufficient Conditions ◽  
Sufficient And Necessary Conditions ◽  
Petri Net Synthesis

We provide motivation for and then study the synthesis of Petri nets. Synthesis can avoid the state exploration problem by guaranteeing correctness for the Petri net. We propose conditions to be imposed on a synthesis shared pb-type subnet for systems specified in Petri nets that ensure the preservation of the liveness and boundedness structural properties. Specifically, we propose a group of sufficient conditions, or both sufficient and necessary conditions, for liveness preservation and boundedness preservation. Possible applications of this synthesis method are illustrated through an example in the form of a flexible manufacturing system. These results are useful for studying the static and dynamic properties of Petri nets for analysing the properties of large complex systems.

scholarly journals Algorithm to Convert Signal Interpreted Petri Net Models to Programmable Logic Controller Ladder Logic Diagram Models

2018 ◽  
Vol 10 (3) ◽  
pp. 905
Author(s):  
Z. Aspar ◽  
Nasir Shaikh-Husin ◽  
M. Khalil-Hani
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Programmable Logic Controller ◽  
Conversion Process ◽  
Programmable Logic ◽  
Logic Diagram ◽  
Speed Up ◽  
High Level ◽  
Ladder Logic ◽  
Matrix Calculation

<span>Signal Interpreted Petri Nets (SIPN) modeling has been proposed as an alternative to Ladder Logic Diagram (LLD) modeling for programming complex programmable logic controllers (PLCs) due to its high level of abstraction and functionalities. This paper proposes an algorithm to efficiently convert existing SIPN models to their LLD models equivalences. In order to automate and speed up the conversion process, matrix calculation approach is used. A complex SIPN model was used to show that existing conversion technique must be expanded in order to cater for a more complex SIPN models.</span>

Sign in / Sign up

Export Citation Format

Share Document