Synchronization Algebras with Mobility for Graph Transformations

We propose a generalization of synchronization algebras that allows to deal with mobility and local resource handling. We show how it can be used to model communication primitives for distributed and mobile computations, such as the ones used in the global computing area. We propose a graph transformation formalism in the Synchronized Hyperedge Replacement approach which is parametric w.r.t. the synchronization algebra and thus allows to model complex systems based on the chosen communication primitives. We thus unify different models described in the literature and we allow to easily define new ones. We present various examples and a case study on Fusion Calculus, showing how different semantics for it can be derived using different synchronization algebras.     

一个面向网络计算的代码迁移性能模型

引入了面向网络计算的代码迁移概念及其三种计算模式。在定性分析了代码迁移模式与传统的Client／Server模式各自所适宜的应用背景及性能之后，建立了应用性能的定量分析模型。并通过一个例子示范性地阐明了定量分析的过程，为正确选择应用开发模式提供了参考。     

一个面向网络计算的代码迁移性能模型

引入了面向网络计算的代码迁移概念及其三种计算模式。在定性分析了代码迁移模式与传统的Client/Server模式各自所适宜的应用背景及性能之后,建立了应用性能的定量分析模型。并通过一个例子示范性地阐明了定量分析的过程,为正确选择应用开发模式提供了参考。     

Towards Behavioral Maude: Behavioral Membership Equational Logic

How can algebraic and coalgebraic specifications be integrated? How can behavioral equivalence be addressed in an algebraic specification language? The hidden-sorted approach, originating in work of Goguen and Meseguer in the early 80's, and further developed into the hidden-sorted logic approach by researchers at Oxford, UC San Diego, and Kanazawa offers some attractive answers, and has been implemented in both BOBJ and CafeOBJ. In this work we investigate both further extensions of hidden logic, and an extension of the Maude specification language called BMaude supporting this extended hidden-sorted semantics.Maude's underlying equational logic, membership equational logic, generalizes and increases the expressive power of many-sorted and order-sorted equational logics. We develop a hidden-sorted extension of membership equational logic, and give conditions under which theories have both an algebraic and a coalgebraic semantics, including final (co-)algebras. We also discuss the language design of BMaude, based on such an extended logic and using categorical notions in and across the different institutions involved. We also explain how Maude's reflective semantics provides a systematic method to extend Maude to BMaude within Maude, including module composition operations, evaluation, and automated proof methods.     

Strong Paraconsistency and the Basic Constructive Logic for an Even Weaker Sense of Consistency

In a standard sense, consistency and paraconsistency are understood as the absence of any contradiction and as the absence of the ECQ (‘E contradictione quodlibet’) rule, respectively. The concepts of weak consistency (in two different senses) as well as that of F-consistency have been defined by the authors. The aim of this paper is (a) to define alternative (to the standard one) concepts of paraconsistency in respect of the aforementioned notions of weak consistency and F-consistency; (b) to define the concept of strong paraconsistency; (c) to build up a series of strongly paraconsistent logics; (d) to define the basic constructive logic adequate to a rather weak sense of consistency. All logics treated in this paper are strongly paraconsistent. All of them are sound and complete in respect a modification of Routley and Meyer’s ternary relational semantics for relevant logics (no logic in this paper is relevant).     

Paraconsistent Declarative Semantics for Extended Logic Programs

We introduce a fixpoint semantics for logic programs with two kinds of negation: an explicit negation and a negation-by-failure. The programs may also be prioritized, that is, their clauses may be arranged in a partial order that reflects preferences among the corresponding rules. This yields a robust framework for representing knowledge in logic programs with a considerable expressive power. The declarative semantics for such programs is particularly suitable for reasoning with uncertainty, in the sense that it pinpoints the incomplete and inconsistent parts of the data, and regards the remaining information as classically consistent. As such, this semantics allows to draw conclusions in a non-trivial way, even in cases that the logic programs under consideration are not consistent. Finally, we show that this formalism may be regarded as a simple and flexible process for belief revision.     

Stochastic Ambient Calculus

Mobile Ambients (MA) have acquired a fundamental role in modelling mobility in systems with mobile code and mobile devices, and in computation over administrative domains. We present the stochastic version of Mobile Ambients, called Stochastic Mobile Ambients (SMA), where we extend MA with time and probabilities. Inspired by previous models, PEPA and Sπ, we enhance the prefix of the capabilities with a rate and the ambient with a linear function that operates on the rates of processes executing inside it. The linear functions associated with ambients represent the delays that govern particular administrative domains. We derive performance measures from the labelled transition semantics as in standard models. We also define a strong Markov bisimulation in the style of reduction semantics known as barbed bisimulation. We argue that performance measures are of vital importance in designing any kind of distributed system, and that SMA can be useful in the design of the complicated mobile systems.     

基于泛逻辑学的柔性命题逻辑研究

现有的数理逻辑是刚性逻辑，不能满足研究不确定性问题的需要．概率测度是研究不确定性问题的重要数学工具．但作为概率推理理论基础的概率逻辑发展不够成熟，影响了它在不确定性推理中的广泛应用．本文第二作者在探索包含确定性和各种不确定性的现实世界逻辑规律的基础上．建立一个包容刚性逻辑和柔性逻辑的命题泛逻辑学体系．本文利用这一研究成果，对命题概率逻辑进行了探讨．     

The Complexity of Modellability in Finite and Computable Signatures of a Constraint Logic for Head-Driven Phrase Structure Grammar

The SRL (speciate re-entrant logic) of King (1989) is a sound, complete and decidable logic designed specifically to support formalisms for the HPSG (head-driven phrase structure grammar) of Pollard and Sag (1994). The SRL notion of modellability in a signature is particularly important for HPSG, and the present paper modifies an elegant method due to Blackburn and Spaan (1993) in order to prove that

话题驱动移动模型

Ad Hoc网络中人群的移动具有趋同性和弱耦合的聚散特性,现有的移动模型对此存在一些研究,然而缺乏对群组变化行为的描述。文中提出话题驱动模型（Topic Driven Mobility Model,TDMM）,使用人与话题的关系模型描述人的行为状态,对节点形成群组的驱动因素进行了研究,更好地刻画了Ad Hoc网络中群组的行为变化特征。通过对部分模型参数进行选取模拟了松散协作的应用场景,仿真结果表明,模型能够体现符合人群的社会性特征,同时能有效地描述节点聚散的运动过程。     

The Basic Constructive Logic for Negation-Consistency

In this paper, consistency is understood in the standard way, i.e. as the absence of a contradiction. The basic constructive logic B_Kc4, which is adequate to this sense of consistency in the ternary relational semantics without a set of designated points, is defined. Then, it is shown how to define a series of logics by extending B_Kc4 up to minimal intuitionistic logic. All logics defined in this paper are paraconsistent logics.     

随机进程代数新技术综述

本文以PEPA语言为例,对近年来发展起来的随机进程代数的缓解状态空间爆炸问题的新技术做一个综述．     

A Petri Net Semantics of a Simple Process Algebra for Mobility

In this paper, we propose a structural translation of terms from a simple variant of the Klaim process algebra into behaviourally equivalent finite high level Petri nets. This yields a formal semantics for mobility allowing one to deal directly with concurrency and causality.