On The Synchronic Structure of Transition Systems

Bernardinello, Luca; Michelis, Giorgio De; Petruni, Katia; Vigna, Sebastiano

doi:10.1007/978-1-4471-3078-9_5

Cited by 27 publications

(29 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the initial definition, a region was defined as a subset of states of the transition system satisfying an homogeneous relation with respect to the set of events. Later extensions [12,13,6] generalize this definition to multisets, which is the notion used in this paper.…”

Section: Generalized Regionsmentioning

confidence: 99%

Process Mining from a Basis of State Regions

Solé¹,

Carmona

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. A central problem in the area of Process Mining is to obtain a formal model that represents selected behavior of a system. The theory of regions has been applied to address this problem, enabling the derivation of a Petri net whose language includes a set of traces. However, when dealing with real-life systems, the available tool support for performing such task is unsatisfactory, due to the complex algorithms that are required. In this paper, the theory of regions is revisited to devise a novel technique that explores the space of regions by combining the elements of a region basis. Due to its light space requirements, the approach can represent an important step for bridging the gap between the theory of regions and its industrial application. Experimental results improve in orders of magnitude state-of-the-art tools for the same task.

show abstract

Section: Generalized Regionsmentioning

confidence: 99%

Process Mining from a Basis of State Regions

Solé¹,

Carmona

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Regions were introduced in the seminal paper [17] for the class of Elementary Net Systems (en-systems) with sequential execution semantics. After that, the original idea has been developed (see, for example, [27]) and extended in several different directions, including: other Petri net classes (e.g., bounded pt-nets without loops [6], pt-nets [26], Flip-flop nets [29], nets with inhibitor arcs [8,28], and nets with localities [25]); synthesis modules of implemented tool frameworks (e.g., Petrify [12], ProM [31], VipTool [5], Genet [9], and Rbminer [30]); application areas (e.g., asynchronous VLSI circuits [12,9,30] and workflows [31]); other semantical execution models (e.g., step sequences [19,28], (local) maximal concurrency [25], and firing policies [14]); and specification formalisms other than transition systems (e.g., languages [13] and scenarios [5]). More details concerning the importance and long term impact of the region concept can be found in the monograph [3].…”

Section: Introductionmentioning

confidence: 99%

Adding A/Sync Places to the Synthesis Procedure for Whole-Place Operations Nets with Localities

Kleijn¹,

Koutny²,

Pietkiewicz-Koutny³

2017

SACS

View full text Add to dashboard Cite

Assuming that the behavioural specification of a concurrent system is given in the form of a step transition system, where the arcs between states are labelled by steps (multisets of executed actions), we focus on the problem of synthesising a Petri net generating a reachability graph isomorphic to a given step transition system. To deal with step transition systems more complicated than those generated by standard Place/Transition nets, we consider in this paper Petri nets with wholeplace operations, localities, and a/sync places. We adapt and extend the general approach developed within the framework of τ -nets and the theory of regions of step transition systems. Building on the results presented in [23], emphasis here is on the role of a/sync places with their potential for an instantaneous transfer of tokens within a step. In a series of results we demonstrate the robustness of the notion of region for Petri net synthesis.

show abstract

“…This problem was solved for the class of Elementary Net Systems in [13] using the notion of a region which links nodes of transition systems (global states) with conditions in the corresponding nets (local states). The solution was later extended to the pure bounded Place Transition Nets ( [7]), general Petri Nets ( [18]), Safe Nets ( [22]) and Elementary Nets Systems with Inhibitor Arcs ( [20,8]), by adopting the original de nition of a region or using some extended notion of a generalised region. It also turned out that using all possible regions which can be found according to the general synthesis method leads to exponential algorithms.…”

mentioning

confidence: 99%

Synthesis of ENI-systems using minimal regions

Pietkiewicz-Koutny

1998

CONCUR'98 Concurrency Theory

View full text Add to dashboard Cite

We consider the synthesis problem for Elementary Net Systems with Inhibitor Arcs (ENI-systems) executed according to the semantics. The relationship between nets and transition systems generated by them (TSENI) is established via the notion of a . The general synthesis problem for ENI-systems was solved in [20], and here we show how to optimise this solution using only minimal regions and selected inhibitor arcs. We also compare the proposed method of eliminating inhibitor arcs in ENI-systems with that introduced in [8] and show that they are similar..

show abstract

On The Synchronic Structure of Transition Systems

Cited by 27 publications

References 7 publications

Process Mining from a Basis of State Regions

Process Mining from a Basis of State Regions

Adding A/Sync Places to the Synthesis Procedure for Whole-Place Operations Nets with Localities

Synthesis of ENI-systems using minimal regions

Contact Info

Product

Resources

About