Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

3 Fundamenta Informaticae

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: unfoldings

Sortuj według:

Ogranicz wyniki do:

Clusters, Confusion and Unfoldings

100%

Haar S.

2001

tom Vol. 47, nr 3,4

259-270

We study independence of events in the unfoldings of Petri nets, in particular indirect influences between concurrent events: Confusion in the sense of Smith [11] and weak interference. The role of structural (conflict) clusters is investigated, and a new unfolding semantics based on clusters motivated and introduced.

Defining Multi-Party Compromises using Unfoldings of Workflow Nets

72%

Köhler-Bußmeier M.

Fundamenta Informaticae

2013

tom Vol. 128, nr 1-2

97--111

In this paper we develop a negotiation and contracting framework for inter-organisational workflows. The overall aim is to compute a group-plan from a given set of individual plans, where plans are formulated in the context of a given inter-organisational workflow between the agents. A general problem is that the individual plans are not consistent, i.e. the intersection of all individual plans does not contain a complete process, which leads from the initial state of the workflow to its final state. Therefore, negotiation is needed to obtain a compromise. In this paper we develop a generic negotiation protocol and use branching processes as the elementary data structure. The generic protocol is adapted within the specifics of our SONAR-framework. SONAR is a specification framework that defines the organisational structure of multi-agent systems. SONAR has a formal notion of teams and team-formation which is used here to instantiate the strategy parameters.

Reachability in Contextual Nets

58%

Winkowski J.

tom Vol. 51, nr 1,2

235-250

Contextual nets, or Petri nets with read arcs, are models of concurrent systems with context dependent actions. The problem of reachability in such nets consists in finding a sequence of transitions that leads from the initial marking of a given contextual net to a given goal marking. The solution to this problem that is presented in this paper consists in constructing a finite complete prefix of the unfolding of the given contextual net, that is a finite prefix in which all the markings that are reachable from the initial marking are present, and in searching in each branch of this prefix for the goal marking by solving an appropriate linear programming problem.