Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: asynchronous computations

Sortuj według:

Ogranicz wyniki do:

Universal Hard Interaction for Clockless Computation. Dem Glücklichen schägt keine Stunde!

Lippi S.

Fundamenta Informaticae

2009

Vol. 91, nr 2

357-394

We give a self-contained presentation of Hard Interaction, a rewriting system on fixed graphs. We discuss the universality of natural subclasses of hard systems and highlight the main ideas that lead to a universal system with 7 rules called Hard Combinators.

Formal asynchronous systems modelling

Kohn M., Schmeck H.

Fundamenta Informaticae

2000

Vol. 42, nr 3,4

335-389

In this paper a formal model for asynchronous systems behaviour is presented which is suited for representing all levels of abstraction appearing in the design process. Based on a structural abstraction of asynchronous computation systems called asynchronous nets the behaviour of an asynchronous system can be represented by a set of so called abstract computations. It is shown how basic properties of such systems, and in particular, delay-insensitive behaviour, could be determined by investigating properties of abstract computations. Finally, it is demonstrated that the model enables formal verification of asynchronous systems over different levels of abstraction.