Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Fundamenta Informaticae

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: COncurrent SYstem

Sortuj według:

Ogranicz wyniki do:

Can Stubborn Sets Be Optimal?

Valmari A., Hansen H.

Fundamenta Informaticae

2011

Vol. 113, nr 3/4

377-397

Literature on the stubborn set and similar state space reduction methods presents numerous seemingly ad-hoc conditions for selecting the transitions that are investigated in the current state. There are good reasons to believe that the choice between them has a significant effect on reduction results, but not much has been published on this topic. This article presents theoretical results and examples that aim at shedding light on the issue. Because the topic is extensive, we only consider the detection of deadlocks. We distinguish between different places where choices can be made and investigate their effects. It is usually impractical to aim at choices that are "best" in some sense. However, one non-trivial practical optimality result is proven.

Improved Decomposition of Signal Transition Graphs

Vogler W., Kangsah B.

Fundamenta Informaticae

2007

Vol. 78, nr 1

161-197

Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a first step; this leads to a modular implementation, which can support circuit synthesis by possibly avoiding state explosion or allowing the use of library elements. In a previous paper, the original method was extended and shown to be much more generally applicable than known before. But further extensions are necessary, and some are presented in this paper. In particular, to avoid dynamic auto-conflicts, the previous paper insisted on avoiding structural auto-conflicts, which is too restrictive; as a main contribution, we show how to work with the latter type of auto-conflicts. This extension makes it necessary to restructure presentation and correctness proof of the decomposition algorithm.

Peter Lauer and COSY

Koutny M.

Fundamenta Informaticae

1999

Vol. 40, Nr 2,3

103-107