Titlebook: CONCUR 2000 - Concurrency Theory; 11th International C Catuscia Palamidessi Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2

moratorium

https://doi.org/10.1007/978-3-531-18740-2h ensures that bisimilarity is a congruence when sufficient RPOs exist. Two examples - a simplified form of action calculi and term-rewriting - are given, for which it is shown that sufficient RPOs indeed exist. The thrust of this paper is, therefore, towards a general method for achieving useful behavioural congruence relations.

irritation

IDEAS

Verification Using Tabled Logic Programmingcently, we have developed.In this tutorial, we describe the XMC system as well as the above developments. In addition, we outline the research efforts of the verification and the logic programming community that have been instrumental in these developments.

小木槌

Verifying Quantitative Properties of Continuous Probabilistic Timed Automataree Logic (PTCTL). Our method improves on the previously known techniques in that it allows the verification of . probability bounds, as opposed to qualitative properties which can only refer to bounds of probability 0 or 1.

旋轉(zhuǎn)一周

大方不好

Deriving Bisimulation Congruences for Reactive Systemsh ensures that bisimilarity is a congruence when sufficient RPOs exist. Two examples - a simplified form of action calculi and term-rewriting - are given, for which it is shown that sufficient RPOs indeed exist. The thrust of this paper is, therefore, towards a general method for achieving useful behavioural congruence relations.

外科醫(yī)生

Evocative

Leaders, Agents and Followers: An Assessment The fusion system framework generalises a new process calculus called the π... We describe the π.-calculus, which is based on different process constructs to those of the π-calculus, and show that the generalisation from the calculus to the framework is simple. We compare the frameworks by studying examples.

pessimism

Leaders, Agents and Followers: An Assessmentat both these problems, with specifications in CTL (CTL*), are 2EXPTIME-complete (resp. 3EXPTIME-complete). Thus, in a sense, reactive environments constitute a provably harder setting for the synthesis of open systems and controllers for them.

outer-ear