The Synthesis Problem for Elementary Net Systems with Inhibitor Arcs

Pietkiewicz-Koutny, Marta

doi:10.3233/fi-1999-402307

Cited by 16 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They have been successfully applied to model inhibitor and priority systems, asynchronous races, synthesis problems, etc. (see for example [11,26,16,17,18,19,20]). The name follows from the following result.…”

Section: Stratified Order Structurementioning

confidence: 99%

Modelling concurrency with comtraces and generalized comtraces

Janicki¹,

Le²

2011

Information and Computation

View full text Add to dashboard Cite

Comtraces (combined traces) are extensions of Mazurkiewicz traces that can model the "not later than" relationship. In this paper, we first introduce the novel notion of generalized comtraces, extensions of comtraces that can additionally model the "non-simultaneously" relationship. Then we study some basic algebraic properties and canonical reprentations of comtraces and generalized comtraces. Finally we analyze the relationship between generalized comtraces and generalized stratified order structures. The major technical contribution of this paper is a proof showing that generalized comtraces can be represented by generalized stratified order structures.

show abstract

Section: Stratified Order Structurementioning

confidence: 99%

Modelling concurrency with comtraces and generalized comtraces

Janicki¹,

Le²

2011

Information and Computation

View full text Add to dashboard Cite

show abstract

“…Automated synthesis from behavioural specifications is an attractive and powerful way of constructing correct concurrent systems [1,2,4,6,7,18,24]. Here we will re-visit the problem of synthesising a Petri net from a behavioural specification given in the form of a transition system.…”

Section: Introductionmentioning

confidence: 99%

Membrane Systems and Petri Net Synthesis

Kleijn¹,

Koutny²,

Pietkiewicz-Koutny³

et al. 2012

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Automated synthesis from behavioural specifications is an attractive and powerful way of constructing concurrent systems. Here we focus on the problem of synthesising a membrane system from a behavioural specification given in the form of a transition system which specifies the desired state space of the system to be constructed. We demonstrate how a Petri net solution to this problem, based on the notion of region of a transition system, yields a method of automated synthesis of membrane systems from state spaces.

show abstract

Transition Systems of Elementary Net Systems with Localities

Koutny

Pietkiewicz-Koutny

2006

CONCUR 2006 – Concurrency Theory

View full text Add to dashboard Cite

The Synthesis Problem for Elementary Net Systems with Inhibitor Arcs

Cited by 16 publications

References 18 publications

Modelling concurrency with comtraces and generalized comtraces

Modelling concurrency with comtraces and generalized comtraces

Membrane Systems and Petri Net Synthesis

Transition Systems of Elementary Net Systems with Localities

Contact Info

Product

Resources

About