Theory of linear and integer programming
Theory of linear and integer programming
Modeling concurrency with partial orders
International Journal of Parallel Programming
A trace semantics for Petri nets
Information and Computation
An event structure semantics for general Petri nets
Theoretical Computer Science - Special volume on Petri nets
Series-parallel languages and the bounded-width property
Theoretical Computer Science
Series-Parallel Posets: Algebra, Automata and Languages
STACS '98 Proceedings of the 15th 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
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
A Programming Approach to the Design of Asynchronous Logic Blocks
Concurrency and Hardware Design, Advances in Petri Nets
Partial words versus processes: a short comparison
Advances in Petri Nets 1992, The DEMON Project
Workflow Mining: Discovering Process Models from Event Logs
IEEE Transactions on Knowledge and Data Engineering
Synthesis of Petri Nets from Finite Partial Languages
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
How to synthesize nets from languages: a survey
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
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 Petri Nets from Finite Partial Languages
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Hardware and Petri nets: application to asynchronous circuit design
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Towards synthesis of petri nets from scenarios
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Hi-index | 0.00 |
In this paper we present an algorithm to synthesize a finite unlabelled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term over a finite set of labelled partial orders using operators for union, iteration, parallel composition and sequential composition. The synthesis algorithm is based on the theory of regions for partial languages presented in [17] and produces a p/t-net having minimal net behaviour including the given partial language. The algorithm uses linear programming techniques that were already successfully applied in [22] for the synthesis of p/t-nets from finite partial languages. Also, an equality test algorithm to check whether the behaviour of the synthesized p/t-net equals the given partial language is shown. Moreover, we present an implementation of the developed synthesis algorithm together with an example case study. Finally, a possible generalization of the presented term based representation of infinite partial languages is discussed.