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: timed event structures

Sortuj według:

Ogranicz wyniki do:

Observational Equivalences for Timed Stable Event Structures

Andreeva M.V., Virbitskaite I.B.

Fundamenta Informaticae

2006

Vol. 72, nr 1-3

1-19

The intention of the paper is to develop a framework for weak observational equivalences in the setting of a real-time partial order model. In particular, we introduce a family of equivalences of linear time - branching time spectrum based on interleaving, causal tree and partial order semantics, in the setting of a dense time extension of stable event structures with internal actions. We study the relationships between the equivalences showing, on one hand, the discriminating power of the approaches of the spectrum and, on the other hand, the coincidence of some semantics in a concrete approach. Furthermore, when dealing with particular subclasses of the model under consideration, there is no difference between more concrete and more abstract observations.

Open Maps and Observational Equivalences for Timed Partial Order Models

Virbitskaite I.B., Gribovskaya N.S.

Fundamenta Informaticae

2004

Vol. 60, nr 1-4

383--399

The intention of the paper is to show the applicability of the general categorical framework of open maps to the setting of timed extensions of partial order models, in order to transfer general concepts of equivalences to the models. In particular, we define categories of timed event structures, whose morphisms are to be thought of as simulations, and accompanying (sub)categories of observations, to which the corresponding notions of open maps are developed. We then use the open maps framework to obtain abstract bisimilarities which are established to coincide with timed extensions of well-known partial order based equivalences.

Analysis of timed concurrent models based on testing equivalence

Andreeva M.V., Bozhenkova E.N., Virbitskaite I.B.

Fundamenta Informaticae

2000

Vol. 43, Nr 1-4

1-20

The intention of the paper is to extend the testing methodology to a model of event structures with a dense time domain. Alternative characterizations of timed testing re-lations are provided. We also present algorithms for deciding timed testing for a sub-class of the model under consideration. The key to our decision algorithms is that timed testing equivalences can be reduced to appropriate symbolic bisimulations.