Toward the use of Petri nets for the formalization of OWL-S choreographies

In this paper, we present a Petri net-based approach for modeling the choreography of semantic Web services which are described following the OWL-S specification. In our approach, each control construct of the OWL-S choreography is represented through a Petri net pattern that captures formally its operational semantics. The main difference between our work and the main proposals that model the semantics of OWL-S services choreography is that, although both approaches represent the service choreography with Petri nets, our proposal is also concerned with the practical execution of the Petri nets by the client. Therefore we also represent the flow of data, the outputs transformations, the effects in the environment, in addition to the structures that control the choreography of the services in our Petri net models. The implementation of the OWL-S choreography is performed in a Petri net ontology-based engine. This is another difference with traditional approaches that only use Petri nets for the analysis of the service properties. Furthermore, the use of an underlying ontology engine for supporting both the domain models of OWL-S services and the Petri net models provides several advantages in terms of reasoning, extension, and reuse.     

基于模糊神经Petri网的故障诊断模型

Petri网是对具有产生式规则的故障诊断系统的有力建模工具，但其缺乏较强的学习能力．本文以Petri网的基本定义为基础，结合模糊逻辑和Petri网模型，定义了模糊Petri网模型，在此基础上引入人工神经网络技术，给出了人工神经网络的模糊Petri网表示方法，并针对工程机械故障诊断异步、离散等特点，提出并建立了故障诊断的模糊神经Petri网模型及其改进模型．基于模糊神经Petri网的故障诊断系统结合了Petri网和人工神经网络的优点，经过自学习后同时具有很强的推理能力和自适应能力．     

着色Petri网模型检测工具的扩展及其在Web服务组合中的应用

Web服务组合的形式化描述和验证是一个重要的研究问题.为了更好地完成验证工作,提出了扩展着色Petri网的模型检测方法.首先,在着色Petri网原有的基于CTL的局部模型检测算法基础上,给出了获取模型检测证据/反例的算法,并在着色Petri网模型检测工具--CPN Tools--中使用ML(meta language)语言实现了这些算法,然后将扩展后的CPN模型检测工具应用在Web服务组合的验证问题中.该方法不仅可以验证Web服务组合是否存在逻辑错误,还能告诉用户发生错误的原因,为Web服务组合的验证提供了技术上的保障.实验表明对着色Petri网的模型检测工具的扩展是正确、有效的.     

基于语义Web的开放本体导航工具设计与实现

语义Web是分布式环境下构建复杂系统的一种新兴技术。针对独立开发的本体存在语义不匹配和逻辑不一致等问题，利用一种具有偏好的、公理半序的、模块化的本体表示语言OSHOQP（D），在开放本体需求分析的基础上，设计了基于语义Web技术的开放本体导航工具模型，使得本体能够并发地编辑和整合。系统由Wiki引擎、Agent、存储管理、本体管理器、导入／导出等模块构成。实现了基于语义Web技术的系统实验原型，为下一步研究开发较成熟的软件产品奠定了良好的基础。     

基于Petri网的Web服务流程建模方法研究

随着网络应用的蓬勃发展,Web服务越来越普及。在实际应用中,往往需要对已有Web服务进行集成。目前通常的企业Web服务集成过程,都是先根据企业的业务流程建立相应的Web服务流程模型,再由此建立应用系统。而目前已有的建模手段的共同问题是：无法确保模型的正确性和与具体业务的紧密吻合。该文提出一种基于Petri网的Web服务流程建模方法。该建模方法通过将Petri网引入建模过程弥补了原建模过程中无法直观感受模型的不足,通过建立一套完备的形式化定义保证了建立模型的正确性,通过将紧同步随机Petri网引入建模过程可以更好的描述实际业务。通过使用该方法, 可以很好地解决现在Web流程建模过程中存在的问题。此方法也为其他领域中的流程建模仿真提供了一种很好的解决问题的方法和思路。     

CPN tools-assisted simulation and verification of nested Petri nets

Nested Petri nets (NP-nets) is an extension of Petri net formalism within the “nets-within-nets” approach, when tokens in a marking are Petri nets wich have autonomous behavior and synchronize with the system net. The formalism of NP-nets allows modeling multi-level multi-agent systems with dynamic structure in a natural way. Currently there is no tool support for NP-nets simulation and analysis. The paper proposes translation of NP-nets into colored Petri nets and using CPN Tools as a virtual machine for NP-nets modeling, simulation and automatic verification.     

基于Petri网的语义Web服务流程一致性验证

提出一种基于Petri网的语义Web服务流程一致性验证方法。该方法将语义Web服务流程转换为Petri网模型,通过分析Petri网的可达标识图,得到所有可并行执行的服务对,根据领域本体和服务功能的语义描述判断2个并行服务对之间是否存在冲突,并计算每个服务在执行前可能处于的状态,以判断服务的可执行性。通过一个实际案例验证了该方法的正确性和有效性。     

Interoperability results for Semantic Web technologies using OWL as the interchange language

Using Semantic Web technologies in complex scenarios requires that such technologies correctly interoperate by interchanging ontologies using the RDF(S) and OWL languages. This interoperability is not straightforward because of the high heterogeneity in Semantic Web technologies and, while the number of such technologies grows, affordable mechanisms for evaluating Semantic Web technology interoperability are needed to comprehend the current and future interoperability of Semantic Web technologies.This paper presents the OWL Interoperability Benchmarking, an international benchmarking activity that involved the evaluation of the interoperability of different Semantic Web technologies using OWL as the interchange language. It describes the evaluation resources used in this benchmarking activity, the OWL Lite Import Benchmark Suite and the IBSE tool, and presents how to use them for evaluating the OWL interoperability of Semantic Web technologies. Moreover, the paper offers an overview of the OWL interoperability results of the eight tools participating in the benchmarking: one ontology-based annotation tool (GATE), three ontology frameworks (Jena, KAON2, and SWI-Prolog), and four ontology development tools (Protégé Frames, Protégé OWL, SemTalk, and WebODE).     

Automatic extraction of OWL ontologies from UML class diagrams: a semantics-preserving approach

Full implementation of the Semantic Web requires widespread availability of OWL ontologies. Manual ontology development using current OWL editors remains a tedious and cumbersome task that requires significant understanding of the new ontology language and can easily result in a knowledge acquisition bottleneck. On the other hand, abundant domain knowledge has been specified by existing database schemata such as UML class diagrams. Thus developing an automatic tool for extracting OWL ontologies from existing UML class diagrams is helpful to Web ontology development. In this paper we propose an automatic, semantics-preserving approach for extracting OWL ontologies from existing UML class diagrams. This approach establishes a precise conceptual correspondence between UML and OWL through a semantics-preserving schema translation algorithm. The experiments with our implemented prototype tool, UML2OWL, show that the proposed approach is effective and a fully automatic ontology extraction is achievable. The proposed approach and tool will facilitate the development of Web ontologies and the realization of semantic interoperations between existing Web database applications and the Semantic Web.     

Robot task plan representation by Petri nets: modelling, identification, analysis and execution

In this paper we introduce a framework to represent robot task plans based on Petri nets. Our approach enables modelling a robot task, analysing its qualitative and quantitative properties and using the Petri net representation for actual plan execution. The overall model is obtained from the composition of simple models, leading to a modular approach. Analysis is applied to a closed loop between the robot controller and the environment Petri net models. We focus here on the quantitative properties, captured by stochastic Petri net models. Furthermore, we introduce a method to identify the environment and action layer parameters of the stochastic Petri net models from real data, improving the significance of the model. The framework building blocks and a single-robot task model are detailed. Results of a case study with simulated soccer robots show the ability of the framework to provide a systematic modelling tool, and of determining, through well-known analysis methods for stochastic Petri nets, relevant properties of the task plan applied to a particular environment.     

基于Petri网合成与化简的分布式数据库系统并发控制的死锁检测

利用模块化设计的思想，首先为分布式数据库系统中各事务的每一种操作(读锁、写锁、解锁)构造一个基本的加权Petri网模型，并给出了加权Petri网共享合成的概念、然后利用共享合成技术，动态地构造各站点的加权Petri网模型，以适应系统的动态变化．此外，本文利用Petri网的化简技术，极大地简化了各站点的Petri网模型，之后利用同步合成技术构造出整个系统的Petri网模型，较好地解决了Petri网的可达性分析中可能出现的状态“爆炸”问题．最后给出了判断整个系统是否出现死锁的充分必要条件．     

Petri网的组合积网及性能分析

Petri网是一种系统描述和分析的工具 .Petri网组合是由小系统的性质获得大系统性质的一种有效的分析方法 .本文提出了 Petri网的组合积运算 ,包括 Petri网的 型组合积运算和 型组合积运算、Petri网的并积运算 ,讨论了保持网的结构性质的条件 ,为复杂大系统的分析提供了新途径     

一种兼顾协议正确性验证和性能评估的Petri网方法

基于Petri网的协议形式化分析方法由于其精炼、简洁和无二义性逐步成为分析协议的一条可靠和准确的途径,但是协议的形式化分析目前研究还不够深入,协议分析的两个重点内容正确性验证和性能评估所需要的模型不同,一种模型只能解决一方面的工作。为了有效地解决这一问题,文中提出了一种用原型Petri网作为协议验证模型的思路和方法,在不改变原型Petri网结构的基础上对变迁赋予发生时延,解决了协议的性能评估问题。本文还给出了协议验证内容与Petri网分析方法的对应关系,并对0-1停止等待协议进行了详细的分析,最后把0-1停止等待协议的原型Petri网模型转化为时延Petri网,对协议的性能进行了评估。     

Laying the foundations for a World Wide Argument Web

This paper lays theoretical and software foundations for a World Wide Argument Web (WWAW): a large-scale Web of inter-connected arguments posted by individuals to express their opinions in a structured manner. First, we extend the recently proposed Argument Interchange Format (AIF) to express arguments with a structure based on Walton's theory of argumentation schemes. Then, we describe an implementation of this ontology using the RDF Schema Semantic Web-based ontology language, and demonstrate how our ontology enables the representation of networks of arguments on the Semantic Web. Finally, we present a pilot Semantic Web-based system, ArgDF, through which users can create arguments using different argumentation schemes and can query arguments using a Semantic Web query language. Manipulation of existing arguments is also handled in ArgDF: users can attack or support parts of existing arguments, or use existing parts of an argument in the creation of new arguments. ArgDF also enables users to create new argumentation schemes. As such, ArgDF is an open platform not only for representing arguments, but also for building interlinked and dynamic argument networks on the Semantic Web. This initial public-domain tool is intended to seed a variety of future applications for authoring, linking, navigating, searching, and evaluating arguments on the Web.     

模糊时间Petri网及其时间推理方法

Petri网是一种用网状图形表示系统模型的方法,它能够从组织结构、控制和管理的角度,精确描述系统中事件(变迁)之间的依赖(顺序)和不依赖(并发)关系。但传统的Petri网理论其不足之处在于:它的分析方法主要是可达树分析法和线性代数描述法。可达树分析法是针对某一个初始标识的,一个新的初始标识就意味着需要重新构造可达状态图;当系统存在较多     

生化网络的随机Petri网建模与分析

细胞的行为是随机性的,学习细胞中的随机性有助于理解细胞的组织,设计和进化。建立、确认和分析随机的生化网络模型是当前计算系统生物学领域的一个重要研究主题。当前,标准的Petri网模型已经成为生化网络模拟和定性分析的有力工具。尝试使用随机Petri网对生化网络进行建模与分析,简单描述了随机Petri网理论对标准Petri网的扩充,通过对二聚作用和肌动蛋白这两个典型例子的建模与演化模拟,介绍、论证了随机Petri网理论的新应用。     

Statechartable Petri nets

Petri nets and statecharts can model concurrent systems in a succinct way. While translations from statecharts to Petri nets exist, a well-defined translation from Petri nets to statecharts is lacking. Such a translation should map an input net to a corresponding statechart, having a structure and behaviour similar to that of the input net. Since statecharts can only model a restricted form of concurrency, not every Petri net has a corresponding statechart. We identify a class of Petri nets, called statechartable nets, that can be translated to corresponding statecharts. Statechartable Petri nets are structurally defined using the novel notion of an area. We also define a structural translation that maps each statechartable Petri net to a corresponding statechart. The translation is proven sound and complete for statechartable Petri nets.     

基于本体的语义Web服务通信协议的研究

在简单介绍语义W eb服务、本体的同时,将本体与通信协议结合,提出建立通信协议本体的概念,并给出协议本体的简单模型。将语义W eb服务中的核心SOAP协议引入到协议本体中,在服务机制中将语义引入消息传输机制,提高服务的灵活性以及适应性。还可减少事务处理中产生的不确定性。