Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Fundamenta Informaticae

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Equational Reasoning on Mobile Ad Hoc Networks

Ghassemi F., Fokkink W., Movaghar A.

Fundamenta Informaticae

2011

Vol. 105, nr 4

375-415

We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize restricted broadcast. It allows one to define the behavior of an ad hoc network with respect to the underlying topologies. We give a sound and ground-complete axiomatization for CNT terms with finite-state behavior, modulo what we call rooted branching computed network bisimilarity.

Is Timed Branching Bisimilarity a Congruence Indeed?

Fokkink W., Pang J., Wijs A.

Fundamenta Informaticae

2008

Vol. 87, nr 3-4

287-311

We show that timed branching bisimilarity as defined by Van der Zwaag [17] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose an adaptation based on Van der Zwaag’s definition, and prove that the resulting timed branching bisimilarity is an equivalence indeed. Furthermore, we prove that in case of a discrete time domain, Van der Zwaag’s definition and our adaptation coincide. Finally, we prove that a rooted version of timed branching bisimilarity is a congruence over a basic timed process algebra containing parallelism, successful termination and deadlock.

A Cancellation Theorem for BCCSP

Aceto L., Fokkink W., Ingolfsdottir A.

Fundamenta Informaticae

2008

Vol. 88, nr 1-2

1-21

This paper presents a cancellation theorem for the preorders in van Glabbeek's linear time-branching time spectrum over BCCSP. Apart from having some intrinsic interest, the proven cancellation result plays a crucial role in the study of the cover equations, in the sense of Fokkink and Nain, that characterize the studied semantics. The techniques used in the proof of the cancellation theorem may also have some independent interest.