Displaying similar documents to “An analytical method for well-formed workflow/Petri net verification of classical soundness”

A hierarchical decomposition of decision process Petri nets for modeling complex systems

Julio Clempner (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

We provide a framework for hierarchical specification called Hierarchical Decision Process Petri Nets (HDPPNs). It is an extension of Decision Process Petri Nets (DPPNs) including a hierarchical decomposition process that generates less complex nets with equivalent behavior. As a result, the complexity of the analysis for a sophisticated system is drastically reduced. In the HDPPN, we represent the mark-dynamic and trajectory-dynamic properties of a DPPN. Within the framework of the...

Colored decision process Petri nets: modeling, analysis and stability

Julio Clempner (2005)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper we introduce a new modeling paradigm for developing a decision process representation called the Colored Decision Process Petri Net (CDPPN). It extends the Colored Petri Net (CPN) theoretic approach including Markov decision processes. CPNs are used for process representation taking advantage of the formal semantic and the graphical display. A Markov decision process is utilized as a tool for trajectory planning via a utility function. The main point of the CDPPN is its...

Calculi of net structures and sets are similar

Ludwik Czaja (2008)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Three basic operations on labelled net structures are proposed: synchronised union, synchronised intersection and synchronised difference. The first of them is a version of known parallel composition with synchronised actions identically labelled. The operations work analogously to the ordinary union, intersection and difference on sets. It is shown that the universe of net structures with these operations is a distributive lattice and – if infinite pre/post sets of transitions are allowed...

Compositions, Generated by Special Nets in Affinely Connected Spaces

Zlatanov, Georgi (2002)

Serdica Mathematical Journal

Similarity:

Special nets which characterize Cartesian, geodesic, Chebyshevian, geodesic- Chebyshevian and Chebyshevian-geodesic compositions are introduced. Con- ditions for the coefficients of the connectedness in the parameters of these special nets are found.

On the analysis of Petri nets and their synthesis from process languages

Ludwik Czaja (2003)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Processes in Place/Transition (P/T) nets are defined inductively by a peculiar numbering of place occurrences. Along with an associative sequential composition called catenation and a neutral process, a monoid of processes is obtained. The power algebra of this monoid contains all process languages with appropriate operations on them. Hence the problems of analysis and synthesis, analogous to those in the formal languages and automata theory, arise. Here, the analysis problem is: for...

Verification of Procedural Programs via Building their Generalized Nets Models Верификация на процедурни програми чрез изграждане на техни обобщени мрежови модели

Todorova, Magdalina (2012)

Union of Bulgarian Mathematicians

Similarity:

Магдалина Василева Тодорова - В статията е описан подход за верификация на процедурни програми чрез изграждане на техни модели, дефинирани чрез обобщени мрежи. Подходът интегрира концепцията “design by contract” с подходи за верификация от тип доказателство на теореми и проверка на съгласуваност на модели. За целта разделно се верифицират функциите, които изграждат програмата относно спецификации според предназначението им. Изгражда се обобщен мрежов модел, специфициащ връзките между...