Theory of regions for the synthesis of inhibitor nets from scenarios

Authors:
Robert Lorenz;Sebastian Mauser;Robin Bergenthum
Affiliations:
Department of Applied Computer Science, Catholic University of Eichstätt-Ingolstadt;Department of Applied Computer Science, Catholic University of Eichstätt-Ingolstadt;Department of Applied Computer Science, Catholic University of Eichstätt-Ingolstadt
Venue:
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Year:
2007

Citing 13
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
Semantics of inhibitor nets

Information and Computation
The synthesis problem for elementary net systems with inhibitor arcs

Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
Synthesising elementary net systems with inhibitor arcs from step transition systems

Fundamenta Informaticae - Application of concurrency to system design
Synthesis of Nets with Inhibitor Arcs

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Workflow mining: a survey of issues and approaches

Data & Knowledge Engineering
Process semantics of general inhibitor nets

Information and Computation
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
Hardware and Petri nets: application to asynchronous circuit design

ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Complete process semantics for inhibitor nets

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
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

How to synthesize nets from languages: a survey

Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Partial Order Semantics of Types of Nets

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Process Discovery using Integer Linear Programming

Fundamenta Informaticae - Petri Nets 2008
Process Discovery using Integer Linear Programming

Fundamenta Informaticae - Petri Nets 2008

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we develop a theory for the region-based synthesis of system models given as place/transition-nets with weighted inhibitor arcs (ptinets) from sets of scenarios describing the non-sequential behaviour. Scenarios are modelled through labelled stratified order structures (LSOs) considering "earlier than" and "not later than" relations between events [6,8] in such a way that concurrency is truly represented. The presented approach generalizes the theory of regions we developed in [10] for the synthesis of place/transition-nets from sets of labelled partial orders (LPOs) (which only model an "earlier than" relation between events). Thereupon concrete synthesis algorithms can be developed.