自主式追踪机器人终端行为的Petri网建模*

针对含有资源流动和信息交互的终端行为建模问题,提出了一种混合Petri网行为建模方法。首先,引入活性变迁和惰性变迁两种变迁模式,描述终端行为的耦合、制约、异步关系。其次,建立混合Petri网模型,揭示化学羽流追踪终端各行为之间的交互关系,以Robotics模块为验证与分析工具,仿真机器人终端运动过程,同时获得6个关节角度变化的平稳曲线。最后,在六自由度串联机器人平台加以验证。实验结果表明,该混合Petri网模型客观真实地表达对象内部逻辑关系与交互作用机制,对自主式羽流追踪机器人终端行为建模是有效可行的。     

基于Petri网的工作流建模方法

将Ｐｅｔｒｉ网方法引入工作流模型描述，并针对工作流的特点对其进行扩展，提出功能网描述方法，使用功能网可使工作流模型得到方便，快速，合理的构架，同时为工作流模型的仿真研究打下了坚实的基础。     

基于系统行为序列的Petri网自动建模方法

要想用Petri网对系统进行有效的模拟和分析,就必须先建立起可靠准确的Petri网模型,目前很少有文献专门研究Petri网对系统的建模问题。对此,提出了基于系统行为序列的Petri网自动建模方法。该方法将系统所有行为序列组合为正规语言表达式,对于不同的系统,给出标注函数(即变迁和系统行为的映射关系),就可以建立起系统的Petri网模型。给出了电话呼叫业务建立用户Petri网模型的一个实例。该方法形式化强、通用性好,建立的模型标准规范,并且可实现机器自动建模,在目前的系统建模研究方面取得了进展。     

基于UML顺序图的Petri网建模

UEL（统一建模语言）是一种功能较强的面向对象图形建模工具，但其过程描述中缺乏严格的语义，而Petri网不仅有形象直观的图形描述还有严格的数学定义。针对一个简单运输系统的建模将二者结合起来，阐述了UML类图、顺序图的Petri网建模转换方法，避免直接进行Petri网建模过程的烦琐，使建模过程清晰可见。     

基于Petri网的工作流建模

Petri网是计算机异步成分之间进行通信的理论基础.Petri网的应用涉及计算机学科的各个领域.文中运用Petri网工具来对工作流技术进行了详细的分析与描述,并用一个例子来说明如何使用Petri网来描述工作流的各种同步关系以及流向,最后,文章还给出了一个由功能模型、数据/信息模型、组织模型、资源模型组成的工作流复合模型.     

有色Petri网的Android恶意代码建模方法研究

针对Android平台的恶意代码分析建模一直是目前移动终端安全的研究重点,对目前常见的恶意代码进行归纳、分类和行为抽取,在对行为进行形式化描述的基础上,提出了一种基于有色Petri网(colored-Petri net,CPN)的恶意代码建模方法,使用该方法能够描述恶意代码从安装、加载到恶意执行的整个过程。最后对恶意软件Bean Bot进行建模,并利用CPN Tools仿真工具分析了模型的可达性和有界性等性质。实验表明该方法可以准确地刻画恶意代码的运行过程,有助于对恶意代码的机制进行深入分析。     

基于Petri网的工作流建模及仿真

本文将Ｐｅｔｒｉ网应用于工作流建模和仿真,提出了用Ｐｅｔｒｉ网描述工作流程的详细过 程以及分析工作流网的详细方法．     

流体随机Petri网与混合Petri网的比较分析

流体随机Petri网和混合Petri网作为传统Petri网的拓展,可以建模离散成分和连续成分并存的混合系统,也可用于解决离散模型的状态空间爆炸问题.由于这两种建模机制远未发展成熟,分析比较它们的异同点有助于机制本身的进一步发展完善,有助于为特定的应用选择合适的建模方法.本文讨论了流体随机Petri网和混合Petri网的定义、连续标识、分析方法、以及相互转换的可能性.结论是这两种建模机制是互补的,各自适合于特定的应用场合.     

基于时间Petri网的工作流建模

随着工作流管理的发展,人们提出了很多扩展Petri网概念用于工作流建模。描述工作流中的资源、资源条件以及任务与资源条件之间的关系是一件很复杂的事情。而现有的用于描述工作流的Petri网在这方面,并不令人满意。该文特别强调资源的概念,在时间Petri网的基础上提出了一种新Petri网———资源条件/任务网(ResourceCondition/Tasknet,简称RC/TN),利用RC/TN网来进行工作流建模,描述工作流的执行过程。并将该工作流建模方法应用于OA流程的描述中。     

Petri网在工作流建模中的应用

Petri网是一种图形化、数学化的建模方法,尤其在办公自动化领域的系统建模,在描述和分析实现上有一定的优势。本文分析了工作流的运行模式,Petri网的工作流描述,并以印刷企业订单为例,实现基于Petri网的工作流建模方法。     

Behavior Relativity of Petri Nets

This paper presents a novel methodology for modelling and analyzing of behavior relations of concurrent systems. The set of all firing sequences of a Petri net is an important tool for describing the dynamic behavior of concurrent systems. In this paper, the behavior relativity of two concurrent subsystems in their synchronous composition is presented. Such behavior relativities, including Controlled Relativity, United Relativity, Interactive Relativity and Exclusive Relativity, are defined respectively. The properties of the relativities are discussed in detail. The analysis method for these properties is based on minimum T-invariants, when two subsystems are live bounded Petri nets. A well-known example has also been analyaed using the new methodology to demonstrate the advantages of the proposed methodology.     

Petri nets modeling and analysis using extended bag-theoreticrelational algebra

Petri nets are a powerful modeling tool for studying reactive, concurrent systems. Analysis of the nets can reveal important information concerning the behavior of a modeled system. While various means for the analysis of the nets has been developed, a major limitation in the analysis, is explosion of large states space in simulation. An efficient method to manage large states space would overcome such a limitation. This paper proposes a framework for the modeling and analysis of Petri nets using relational database technologies. Formalism of the framework is based on a bag-theoretic relational algebra extended from the conventional, Within the framework, Petri nets are formalized by bag relations, and analysis algorithms are developed based on such formal relations. Properties associated with the nets are formalized by queries described in terms of the bag-theoretic relational algebra. The framework has been realized in a commercial relational database system using a standard SQL.     

Threat-driven modeling and verification of secure software using aspect-oriented Petri nets

Design-level vulnerabilities are a major source of security risks in software. To improve trustworthiness of software design, this paper presents a formal threat-driven approach, which explores explicit behaviors of security threats as the mediator between security goals and applications of security features. Security threats are potential attacks, i.e., misuses and anomalies that violate the security goals of systems' intended functions. Security threats suggest what, where, and how security features for threat mitigation should be applied. To specify the intended functions, security threats, and threat mitigations of a security design as a whole, we exploit aspect-oriented Petri nets as a unified formalism. Intended functions and security threats are modeled by Petri nets, whereas threat mitigations are modeled by Petri net-based aspects due to the incremental and crosscutting nature of security features. The unified formalism facilitates verifying correctness of security threats against intended functions and verifying absence of security threats from integrated functions and threat mitigations. As a result, our approach can make software design provably secured from anticipated security threats and, thus, reduce significant design-level vulnerabilities. We demonstrate our approach through a systematic case study on the threat-driven modeling and verification of a real-world shopping cart application.     

Performance analysis using Petri nets

The purpose of this paper is to focus on the implementation issues associated with using Petri nets for the performance analysis of discrete event dynamic systems while demonstrating several applications in manufacturing systems. Practical modeling issues will be discussed and several applications will be presented that illustrate the advantages and limitations of this methodology. These issues lead to the definition of several research problems in Petri nets for performance analysis.     

Mission-based online generation of probabilistic monitoring models for mobile robot navigation using Petri nets

This paper presents a generic hybrid monitoring approach, which allows the detection of inconsistencies in the navigation of autonomous mobile robots using online-generated models. A mission on the context of the navigation corresponds to an autonomous navigation from a start to an end mission point. The operator defines this mission by selecting a final goal point. Based on this selection the monitoring models for the current mission must be generated online. The originalities of this work are (i) the association of classic state estimation based on a particle filter with a special class of Petri net in order to deliver an estimation of the next robot state (position) as well as the environment state (graph nodes) and to use both pieces of information to distinguish between external noise influences, internal component faults and global behaviour inconsistency (ii) the integration of the geometrical and the logical environment representation into the monitor model (iii) the online generation of the corresponding monitoring model for the present mission trajectory while the system is running. The model takes simultaneously into account the uncertainty of the robot and of the environment through a unified modelling of both. To show the feasibility of the approach we apply it to an intelligent wheelchair (IWC) as a special type of autonomous mobile robot.     

Concurrency bugs in multithreaded software: modeling and analysis using Petri nets

In this paper, we apply discrete-event system techniques to model and analyze the execution of concurrent software. The problem of interest is deadlock avoidance in shared-memory multithreaded programs. We employ Petri nets to systematically model multithreaded programs with lock acquisition and release operations. We define a new class of Petri nets, called Gadara nets, that arises from this modeling process. We investigate a set of important properties of Gadara nets, such as liveness, reversibility, and linear separability. We propose efficient algorithms for the verification of liveness of Gadara nets, and report experimental results on their performance. We also present modeling examples of real-world programs. The results in this paper lay the foundations for the development of effective control synthesis algorithms for Gadara nets.     

Process modeling and analysis of manufacturing supply chain networks using object-oriented Petri nets

This paper presents a systematic methodology for modeling and analysis of manufacturing supply chain business processes. The proposed approach first employs Computer Integrated Manufacturing Open System Architecture (CIMOSA) behavior rules to model the business process routing structures of manufacturing supply chain networks. Object-oriented predicate/transition nets (OPTNs) are then developed for the modular modeling and analysis of process models. Based on the structure of OPTNs, a procedure to obtain the system's P-invariants through objects’ P-invariants is suggested. From the P-invariants obtained, system structural properties such as deadlock and overflow can be analyzed. By using Petri net unfolding techniques and by extracting the process model of each object from the entire process model, the sequencing analysis for operations in supply chain processes becomes possible. Several manufacturing supply chain examples are used to illustrate the effectiveness of the proposed method.     

一种面向对象模糊Petri网建模方法的研究*

针对一些复杂知识系统的知识不确定性及知识规则数量多的特点,在模糊Petri网（FPN）的基础上给出了面向对象模糊Petri网（object-oriented fuzzy Petri net, OOFPN）的形式化定义及其知识表示和知识推理。通过面向对象技术,可以采用模块化方法设计知识系统,将复杂知识系统划分为许多功能子系统,从而降低构建知识系统的复杂性,方便知识系统的优化和管理。