检索结果-南通市图书馆

作者： Zubair Muhammad 南京理工大学

学位级别：硕士

Software as a Service(SaaS)can possibly change the way data innovation(IT)divisions identify with and even cerebrate about their part as suppliers of figuring services to whatever is left of the *** development of SaaS as an adequate software-dissemination system causes an open door for IT divisions to transmute their concentration from conveying and sustaining applications to dealing with the services that those applications give.A prosperous service-driven IT,thus,specifically induces more esteem for the business by giving services that draw from both interior and outside sources and adjust proximately to business *** the rapid increment on the number of software systems and its's user,the complexity to manage the software systems is not very *** as a service(SaaS)provides only user required software services in form of web-mostly based on the vendor developed/maintained model,which creates the new challenges for the software customers(tenants).In this thesis,we purpose a multi-layered architecture of SAAS framework,customized by both vendors and tenants-with the help of process *** far most of SaaS arrangements depend on a multitenant *** this model,a solitary adaptation of the application,with a solitary arrangement(equipment,organize,working framework),is utilized for all clients to bolster adaptability,the application is introduced on numerous machines(called flat scaling).Now and again,a moment form of the application is set up to offer a select gathering of clients with access to pre-discharge adaptations of the applications for testing *** is appeared differently in relation to customary software,where numerous physical duplicates of the software each conceivably of an alternate adaptation,with a possibly unique setup,and frequently modified are introduced crosswise over different client ***,the architecture will be able to offer an extant vendor model of SAAS as well as tenant bas

关键词： SAAS Software Customization process algebra Multi-layered Architecture workflow

来源：

同方学位论文库评论

在线全文

同方学位论文库

学校读者我要写书评

暂无评论

Model for Software Behaviour Detection Based on process algebra and System Call

引用

China Communications 2013年第11期10卷 24-36页

作者：申利民王涛马川 College of Information Science and Engineering Yanshan University The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Hebei Normal University of Science and Technology

Behaviour detection models based on automata have been studied widely. By add- ing edge ε, the local automata are combined into global automata to describe and detect soft- ware behaviour. However, these methods in- troduce nondeterminacy, leading to models that are imprecise or inefficient. We present a model of software Behaviour Detection based on process algebra and system call （BDPA）. In this model, a system call is mapped into an action, and a function is mapped into a process We construct a process expression for each function to describe its behaviour. Without con- strutting automata or introducing nondeter- minacy, we use algebraic properties and algo- rithms to obtain a global process expression by combining the process expressions derived from each function. Behaviour detection rules and methods based on BDPA are determined by equivalence theory. Experiments demon- strate that the BDPA model has better preci- sion and efficiency than traditional methods.

关键词： intrusion detection software be-haviour model static analysis process algebra system call

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Modelling of European Train Control System using process algebra

Modelling of European Train Control System using Process Alg...

引用

第30届中国控制与决策会议

作者： Zhuo Guo Jianzhong Qiao Shukuan Lin School of Computer Science and Engineering Northeastern University

Standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. We extend Milner’s process calculus ccs with a formal definition of the notion of priority. The paper illustrates the use of priorities in process algebras by a real-world example dealing with the design of ETCS（European Train Control System）. It demonstrates the importance of priorities for modeling distributed real-time systems by means of a practically relevant case study of the moving block operation model of ETCS. The paper presents a first simplified model of communication failure and recovers behavior as well as safety-critical data exchange.

关键词： Real-time Systems process algebra Global System for Mobile Communications(GSM) GSM-railway(GSM-R) ETCS and Industrial Internet

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Modeling and Verifying Concurrent Programs with Finite Chu Spaces

引用

Journal of Computer Science & Technology 2010年第6期25卷 1168-1183页

作者：杜旭涛刑春晓周立柱 Department of Computer Science and Technology Tsinghua University Research Institute of Information Technology Tsinghua University

Finite Chu spaces are proposed for the modeling and verification of concurrent *** order to model not only typical concurrent behaviors but also modern exception handling and synchronization mechanisms,we design an enriched process algebra of Chu spaces from a practical point of *** illustrate the power of finite Chu spaces and the process algebra while abstracting away from language-specific details,an imaginary concurrent programming language（ICL） is designed.A denotational semantics of ICL is presented using finite Chu spaces and the enriched process *** valuation functions are fairly straightforward since the carefully designed operators have done much of the *** enriched process algebra is also used as the specification language for Chu spaces,with which process-algebraic properties can be *** algorithms are presented with their time complexities discussed.

关键词： Chu spaces process algebra verification denotational semantics concurrency

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Extension of π-Calculus with Interval Action Prefixes

引用

Chinese Journal of Electronics 2016年第5期25卷 848-857页

作者： LUO Ling DUAN Zhenhua TIAN Cong Institute of Computing Theory and Technology Xidian University

This paper presents an extension of π-calculus, named p-π, with interval action prefixes. The syntax and operational semantics of p-π are formalized, and the algebraic and time-dependent properties are *** on them, how time-dependent behaviors of systems can be modeled with p-π is demonstrated. Finally, a case study is given to illustrate how p-π is used in practise.

关键词： π-Calculus process algebra Interval action prefixes Specification Verification

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Reaction Graph

引用

Journal of Computer Science & Technology 1998年第6期13卷 510-530页

作者：傅育熙 Department of Computer Science Shanghai Jiao Tong University Shanghai P.R. China

The paper proposes reaction graphs as graphical representations of computational objects.A reaction graph is a directed graph with all its arrows and some of its nodes labeled. Compu-tations are modeled by graph rewriting of a simple nature. The basic rewriting rules embodythe essence of both the communications among processes and cut-eliminations in proofs. Cal-culi of graphs are identified to give a formal and algebraic account of reaction graphs in thespirit of process algebra. With the help of the calculi, it is demonstrated that reaction graphscapture many interesting aspects of computations.

关键词： Concurrent computation process algebra computational model.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

The specification and analysis of network embedded system

引用

Journal of Harbin Institute of Technology(New Series) 2005年第4期12卷 434-439页

作者：张冠华张连华白英彩 Dept. of Computer Science and Technology Shanghai Jiaotong University Shanghai 200030 China

This paper proposes a formal method which is used to model and analyze network devices such as touters. It is based on an algebraic process called “ACSR-VP”, which enhances the original CCS algebraic process by incorporating the notions of time, resource requirements, dynamic prioritization, and synchronization. Therefore, although there are many formal methods to analyze the timed concurrency system, ACSR-VP, due to its prominent features, is best fit for analysis of a resource bounded real-time system. This paper extends ACSR-VP to EACSR-VP, which is more adaptive to the features of network devices and specializes in analyzing this kind of embedded system. EACSR-VP adds the notion of n-way communication which allows more than two processes to participate in synchronization. It also enhances value-passing capabilities which make for more flexible specifications. Finally, specifications, verification and analysis methods with EACSR-VP are introduced by a case study of router with multiple input queues.

关键词： Formal method process algebra network devices modeling

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Bisimulation Lattice of Asymmetric Chi Calculus with Mismatch

引用

High Technology Letters 2003年第4期9卷 50-55页

作者：董笑菊 Zhong Farong FU Yuxi Department of Computer Science Shanghai Jiaotong University Shanghai 200030 P.R.China

This paper carries out a systematic investigation into the bisimulation lattice of asymmetric chi calculus with a mismatch combinator. It is shown that all the sixty three L bisimilarities collapse to twelve distinct relations and they form a bisimulation lattice with respect to set inclusion. The top of the lattice coincides with the barbed bisimilarity.

关键词： process algebra asymmetric chi process bisimulation lattice

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An Invitation to Friendly Testing

引用

Journal of Computer Science & Technology 1998年第6期13卷 531-535页

作者： DaviddeFrutos－Escring LuisLlana－Diaz 等 Dept.deSistemasInformaticosyProgramacionUniversidadComplutensedeMadrid E－28040MadridSpain Dept.deSis

We present a new testing semantics, called friendly testing, whose main property is thatthe induced preorder between processes fr is consistent with the conformance relation, andso we have, for instance, a b fr a fr a + b. The new theory is strongly based on De Nicola& Hennessy's work on testing. Friendly tests are defined exactly as in their work, except thatinternal actions are not allowed. However, in order to obtain the desired notion of friendlytesting this restriction is not enough and we also have to relax the conditions to pass a *** we obtain a new testing semantics and a new preorder between processes which is strictlyweaker than the relation must. Moreover, we present an alternative characterization of ournew testing semantics by defining a modification of acceptance sets.

关键词： process algebra semantics of concurrency testing conformance.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Mathematical Modeling of Ubiquitous Systems

Mathematical Modeling of Ubiquitous Systems

引用

2008 the First IEEE International Conference on Ubi-Media Computing and Workshops(U-Media2008)

作者： Kenji Ohmori Computer Tosiyasu L. Kunii Information Sciences Hosei University 3-7-2 Kajino-cho Koganei-shi Tokyo 184-8584 Japan Morpho Inc. The University of Tokyo Entrepreneur Plaza 7-3-1 Hongo Bunkyo-ku Tokyo 113-0033 Japan

Ubiquitous systems built in the environment of distributed or parallel computing are more complicated than conventional digital systems. This paper describes how ubiquitous systems are modeled mathematically or in a formal way using the incrementally modular abstraction hierarchy. Firstly, the system requirements represented by event sequences are mathematically expressed by the Cartesian product of actors and events using a fiber bundle. Then, the fiber bundles is lifted by the homotopy lifting property to the set of subspaces, each of which describes the behavior of a part of the system. This property is used for modeling the ubiquitous system in a bottom-up way. Assembling behaviors distributed in parts of the system, the behavior of an actor is defined by the homotopy extension property for modeling the system in a top-down way. Finally, the behaviors of the actors are adjoined together by attaching functions to express the system behavior, which is equivalent to the process obtained by process algebra. The problem of process algebra not having the methodology of how the system is modeled from system requirements to formal description is solved by the proposed incrementally modular abstraction hierarchy.

关键词： Homotopy incrementally modular abstraction hierarchy process algebra system development.

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：