Titlebook: Structures in Concurrency Theory; Proceedings of the I J?rg Desel Conference proceedings 1995 British Computer Society 1995 algebra.calculu

WAG

Linear Space Algorithm for On-line Detection of Global Predicates, and Marzullo defined this problem as .(Φ)..This paper presents the first on-line algorithm using linear space which solves this problem in the general case, improving all existing algorithms both in time and space. It is particularly interesting for the detection of .(Φ) on potentially infinite com

refine

A Simple Decision Method for the Linear Time Mu-calculus,ether a given .-formula is satisfiable, and give a direct proof of its completeness. Although simpler than the existing methods, it gives rise to an algorithm working in the same 2.(....) time as these, or alternatively, to a polynomial space, singly exponential time algorithm. What is more importan

喚醒

使高興

假裝是我

Metric completion versus ideal completion,cker [4] proposed a metric setting for handling concurrency, recursion and nontermination, which has proved to be very successful in many applications. Starting with a semantic domain . for ‘finite behaviour’ we investigate the relation between the ideal completion .(.) and the metric completion whi

運(yùn)動(dòng)性

觀點(diǎn)

Diaphragm

BROTH

Conformance: A Precongruence close to Bisimilarity,ined in it, which we call conformance, is obtained by the usual means and a complete axiomatization for conformance of finite processes is given. The paper ends with an example to show the use of this relation.

食道

On The Synchronic Structure of Transition Systems,stance measuring their degree of synchronization. In this paper we show that a natural generalization of regions introduced by Ehrenfeucht and Rozenberg exactly corresponds to synchronic distances and that this notion of region can be used to axiomatise a class of transition systems corresponding to bounded place/transition nets without loops.