Regions of Petri nets with a/sync connections

Authors:
Jetty Kleijn;Maciej Koutny;Marta Pietkiewicz-Koutny
Affiliations:
LIACS, Leiden University, P.O.Box 9512, NL-2300 RA Leiden, The Netherlands;School of Computing Science, Newcastle University, Newcastle upon Tyne, NE1 7RU, United Kingdom;School of Computing Science, Newcastle University, Newcastle upon Tyne, NE1 7RU, United Kingdom
Venue:
Theoretical Computer Science
Year:
2012

Citing 19
Cited 0

Partial (set) 2-structures. Part I: basic notions and the representation problem

Acta Informatica
Elementary transition systems

Selected papers of the Second Workshop on Concurrency and compositionality
A trace semantics for Petri nets

Information and Computation
The synthesis problem of Petri nets

Acta Informatica
The synthesis problem for elementary net systems is NP-complete

Theoretical Computer Science
Zero-safe nets: comparing the collective and individual token approaches

Information and Computation - Special issue on EXPRESS 1997
On the Petri net realization of context-free graphs

Theoretical Computer Science
Flip-Flop Nets

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Deriving Unbounded Petri Nets from Formal Languages

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Synthesis of Nets with Inhibitor Arcs

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Theory of Regions

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Coloured Petri Nets Extended with Channels for Synchronous Communication

Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Reo: a channel-based coordination model for component composition

Mathematical Structures in Computer Science
Process Discovery Using Integer Linear Programming

PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Synthesis of Petri Nets from Scenarios with VipTool

PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Synthesis of Nets with Step Firing Policies

Fundamenta Informaticae - Petri Nets 2008
Genet: A Tool for the Synthesis and Mining of Petri Nets

ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
Structured Occurrence Nets: A Formalism for Aiding System Failure Prevention and Analysis Techniques

Fundamenta Informaticae
Synthesising Elementary Net Systems with Inhibitor Arcs from Step Transition Systems

Fundamenta Informaticae - Application of Concurrency to System Design

Quantified Score

Hi-index	5.23

Visualization

Abstract

Automated synthesis from behavioural specifications, such as transition systems, is an attractive way of constructing correct concurrent systems. In this paper, we investigate the synthesis of Petri nets which use special connections between transitions and places. Along these a/sync connections tokens can be transferred instantaneously between transitions executed in a single step. We show that for Place/Transition nets with a/sync connections the synthesis problem can be treated within the general approach based on regions of step transition systems. We also show that the problem is decidable for finite transition systems, and outline a suitable construction algorithm.