an Li

Multilateral Multi-issue Automated Negotiation Model Based on GA

A GA-based multilateral multi-issue automated negotiation model has been proposed. It dynamically estimates the opponentpsilas preference according to the change of the opponentpsilas offer in the process of negotiation and finally accelerates agents to reach an agreement. Experimental results show that agents can reach an agreement in a short time using this model, and the total utility of all agents approximates the highest social utility.

A non-interleaving denotational semantics of value passing CCS with action refinement

Process algebra provides essential tools for studying concurrent systems. An important branch of process algebra is value passing CCS. However, value passing CCS lacks not only action refinement, which is an essential operation in the design of concurrent systems, but also non-interleaving semantics, which is appropriate to specify the partial order and equivalence relations. In this paper, we will define action refinement and non-interleaving semantics by valued stable event structures and valued labeled configuration structures in which special valued actions will be executed. The refinement operation and semantics are useful for the hierarchical design methodology in value passing CCS, e.g. top-down system design.

An Efficient Algorithm for Transforming LTL Formula to Büchi Automaton

Model checking is an automatic technique for verifying finite state concurrent systems. A rapid solution for the model checking problem is checking the emptiness of product Buchi automaton (BA) of the automaton for finite system and the one for the linear temporal logic (LTL) formula, so the algorithm for transforming LTL formula to BA is one of the bases of the whole model checking procedure. In this article, we propose a new efficient algorithm for transforming LTL formula to BA basing on analysis of the tableau structures of LTL formulae, which could efficiently reduce the size of the automaton, but not increases the spatiotemporal complexity, potentially the efficiency of the whole procedure of verification can be improved.

Process Algebra for Web Servers with Timed-Priority Executing Policy

Web servers providing services are widely used in Internet. The behaviors of web servers can be expressed by actions equipped with parameters of time and priority. However, process algebras nowadays cannot specify the behaviors of web server with different groups of clients with priorities and time limitations. We present a process algebra with timed-priority executing policy that can specify the behaviors of web server, with its actions equipped with parameters of time and priority.

Stochastic Extension for Real Time Process Algebra with Urgency Executing Policy

Real time process algebra with urgency executing policy can specify the behaviors of real time systems. But in reality, the executing time of real time systems behavior is not determined to an accurate value. As executing time obey the exponential distribution, stochastic process algebras equip their actions with exponential variable λ. In order to specify real time systems behaviors more accurately, we propose a stochastic extension for real time process algebra with urgency executing policy.

Process algebra with chaos executing policy for unhealthy systems

Healthy systems are important for us, but unhealthy systems exist everywhere. Healthy systems behave the manner they are designed, but not the unhealthy ones. It is a meaningful thing for us to turn an unhealthy system into a healthy one. We propose a process algebra with chaos executing policy to specify the behavior of unhealthy systems. For unhealthy systems, we also propose the equivalent relationships which are vital for the cure of them.

Mathematical analysis of stage-based programmable logic controller

The modern stage suspended boom system is automatically controlled by PLC (programmable logic controller), and represents a typical hybrid behavior. It is an important family of stage control machinery systems. This paper presents a formal approach to modeling the system behaviors of different scenes. The system is formally characterized and specified in a timed model. System properties are proved in the proof system of the extended duration calculus. The case study illustrates the feasibility of the proposed verification framework.

An Intelligent Mathematics Assessment System

A Web-based intelligent mathematics assessment system, as a part of education system, is extremely useful to assess the ability of students. The paper mainly focuses on three research topics in the intelligent mathematics assessment system: answer input methods, generating of random question, and answer checking. The paper discusses the design methods and principles of mathematical questions based on the prototype of test question. The paper also introduces a mathematical answer checking protocol and an answer checking and grading method. Furthermore both WYSIWYG editing and command-line editing operations of mathematical expression on the Web are addressed in the paper. I. INTRODUCTION Nowadays Web-based mathematics education system has been widely used in order to accelerate the rapid development of Web-based mathematics education. A Web-based intelligent mathematics assessment system is a part of education system which is extremely useful to assess the ability of students (7). In the past ten years many research institutes and companies have developed a lot of computer aided assessment (CAA) systems((2), (4), (6)). However some primary problems have not been solved ideally in these systems, such as automatic generation of questions, well display and convenient input of mathematical content, intelligent answer checking. Therefore, we believe that development of an intelligent mathematics assessment system is essential and has strong practical sig- nificance. In this paper, we discuss some recent developments in mathematical computer aided assessment which employs com- puter algebra system (CAS) to evaluate the work of students using the internet. Based on the study of existing computer aided assessment systems of mathematics, we designed and developed a modern intelligent Web-based mathematics as- sessment system MathPASS. Figure 1 shows the architecture of MathPASS. MathPASS is a practical system which has been applied in some schools in USA. MathPASS can generate random mathematical test questions with pre-defined question type, let users enter their answer both in WYSIWYG GUI interface and in infix-based character-string input environment, and check the user answer with an assistant of computer algebra system. The paper mainly focused on three research topics in the intelligent mathematical assessment system: answer input methods, generating of random question, and answer checking. The paper discusses the design method and principle of mathematical question based on the prototype of test question. We also address a CAS-based intelligent answer checking methods and give a mathematical answer checking protocol in the paper.

Stochastic Process Algebra with Value-Passing

Process algebras provide essential tools for studying distributed and concurrent systems. Stochastic process algebras (SPAs) equip process algebras with stochastic extensions which are perfect to analyze phenomena of the real world. With value passing, actions can be analyzed with their values. Process algebras with value passing can be used to analyze the systemspsila behaviors at a more detailed level. Lacking value passing, SPAs cannot specify such behaviors under conditional process expressions which are very important. Based on this, SPA (e.g. YAWN) is extended with value passing.