Region based synthesis of P/T-nets and its potential applications

Authors:
Philippe Darondeau
Affiliations:
IRISA, Rennes Cedex
Venue:
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Year:
2000

Citing 9
Cited 4

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

Acta Informatica
Partial (set) 2-structures. Part II: state spaces of concurrent systems

Acta Informatica
Petri nets and automata with concurrency relations—an adjunction

Semantics of programming languages and model theory
The synthesis problem of Petri nets

Acta Informatica
Polynomial Algorithms for the Synthesis of Bounded Nets

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Deriving Unbounded Petri Nets from Formal Languages

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Checking Regular Properties of Petri Nets

CONCUR '95 Proceedings of the 6th 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
Dualities Between Nets and Automata Induced by Schizophrenic Objects

CTCS '95 Proceedings of the 6th International Conference on Category Theory and Computer Science

HMSCs as Partial Specifications ... with PNs as Completions

MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Behavior and Realization Construction for Petri Nets Based on Free Monoid and Power Set Graphs

Unifying Petri Nets, Advances in Petri Nets
HMSCs as partial specifications ... with PNs as completions

Modeling and verification of parallel processes
Hasse Diagram Generators and Petri Nets

PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

This talk is an informal presentation of ideas put forward by Badouel, Bernardinello, Caillaud and me for solving various types of P/T-net synthesis problems, with hints at the potential role of net synthesis in distributed software and distributed control. The ideas are theirs as much as mine. The lead is to start from Ehrenfeucht and Rozenberg's axiomatic characterization of behaviours of elementary nets, based on regions, to adapt the characterization to P/T-nets in line with Mukund's extended regions with integer values, and to profit from algebraic properties of graphs and languages for converting decision problems about regions to linear algebra.