Ada中实时结构的Petri网建模与分析

本文从一般时间网出发，派生出一种简单时间网，并建模了延迟，分支选择，异步选择，优先权等Ada实时结构，特别是把优先权处理为一种时间特性，这样不仅扩充了Petri网在Ada中的建模能力，同时可以更加准确刻画Ada程序行为。     

基于网语言的Ada程序局部性质的分析和验证

旨在研究利用网语言讨论Ada程序性质和由此而引起的Ada网的状态爆炸问题.研究了Ada网的同步合成与分解,讨论了它们的语言性质,并利用这一结果分析和验证了Ada程序的安全性和活性,从而为复杂的Ada程序的分析与验证提供了一个新的有效途经.     

基于Ada的交叉引用语言CRL/Ada

本文介绍一种基于Ａｄａ的交叉引用语言ＣＲＬ／Ａｄａ,它用于描述Ａｄａ程序实体的定义与引用信息,在软件维护的过程中,利用它可以方便地获得软件源程序中的实体信息。本文将介绍它的设计思想、程序结构与应用。     

Ada语言与Occam语言的比较

一、引言过去十年在计算语言领域的重要进展之一是出现了具有并行计算能力的Ada语言和Occam语言。Ada语言是具有类似Pascal语言的控制结构,并且能重植入过程和函数的大型语言,其初始设计目标是满足美国国防部所规定的要求,即首先考虑支持适于军事装备的嵌入式编程系统。就本质而言,Ada语言是在串行语言的结构上,扩充增加了并发执行的能力。 Occam语言是和Transputer同时设计实     

时序逻辑电路设计的Petri网方法

1 引言 Petri网是一种系统模拟和分析的工具,它可以揭示出被模拟系统在结构和动态行为方面信息,利用这些信息可以对被模拟系统进行性能评估并提出改进系统的建议,从而设计出一个高质量的实际应用系统。文[1,2]利用Petri网的特性分别给出了组合逻辑电路和时序电路的Petri网分析方法,其基本思想是将已设计好的逻辑电路转化成Petri网,利用Petri网的各种分析方法(可达树、状态矩阵)进行分析。时序电路的设计是分析方法的逆过程,是根据给定的状态图或通过对设计要求的分析得到的状态图,设计出时序电路的过程;时序逻辑电路可分为同步和异步,然而采用传统的时序电路的设计方法时,即使是同步时序电路的设计也需要     

并发程序验证的时序Petri网方法

并发程序的设计、分析和验证已经成为计算机理论界基础理论研究的方向之一。Petri网和时序逻辑被认 为是探讨该问题较为有效的两个理论工具,但二者都有局限性。该文引用一种新网子类;时序Petri网,描述了并发程序的时序Petri网建模方法;利用网结构描述程序基本框架及保证语句的原子性,通过时序逻辑公式反映程序的共享逻辑变量的赋值变化及时序关系,从而有效地对基本网无法描述的并发程序进行了建模;在此基础上,结合Petri网的可达图分析技术和时序逻辑的演绎公式,分析和验证了并发程序的安全性和活性性质。     

Ada语言回顾与展望

本文概述了 Ada 语言的研制背景与过程,讨论了 Ada 与其它语言的区别、Ada 的成就与不足,分析了 Ada 的现状并展望了 Ada 的未来。     

Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems

This paper presents some results of integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems. The intention of this research is to use predicate transition nets as a specification method and to use first order temporal logic as a verification method so that their strengths — the easy comprehension of predicate transition nets and the reasoning power of first order temporal logic can be combined. In this paper, a theoretical relationship between the computation models of these two formalisms is presented; an algorithm for systematically translating a predicate transition net into a corresponding temporal logic system is outlined; and a special temporal refutation proof technique is proposed and illustrated in verifying various concurrent properties of the predicate transition net specification of the five dining philosophers problem.     

Distributing concurrent Ada programs by source translation

This paper tackles the practical aspects of obtaining a distributed version of an Ada program. It proposes the use of an adapter, which can be a methodology or an automatic translator. The adapter accepts source of a concurrent Ada program, adds communication and control tasks, and produces source for a single distributed Ada program, which can then be compiled and run on a multi-processor computer. The original program can consist of packages and tasks, and both of these can be classed as virtual nodes. The process of adaption does not alter the contents of any package in the original program, so that the method is directly applicable to systems that make use of library and generic packages. The communication between virtual nodes, which would normally reside as one per processor, is via messages on a ring, but the protocols are kept as simple as possible, and the messages are fully checked Ada types, rather than byte strings. The method has been applied to programs of the client-server model, and could be adapted for other rendezvous-based languages such as occam.     

Distributed simulation of modular time Petri nets: An approach and a case study exploiting temporal uncertainty

This paper proposes an approach to modular modelling and simulation of complex time-critical systems. The modelling language is represented by Merlin and Farber’s Time Petri Nets (TPNs) augmented with inhibitor arcs and modular constructs borrowed from the Petri Net Markup Language (PNML) interchange format. Analysis techniques depend on Temporal Uncertainty Time Warp (TUTW), a time warp algorithm capable of exploiting temporal uncertainty in general optimistic simulations over a networked context. A key feature of the approach is the fact that TPN models naturally exhibit a certain degree of temporal uncertainty which the TUTW control engine can exploit to achieve good speedup without a loss in the accuracy of the simulation results. The developed TUTW/TPN kernel is demonstrated by modelling and simulation of a real-time system example.A preliminary version of this paper was presented at 38th SCS Annual Simulation Symposium, April 4–6, 2005, San Diego (CA), IEEE Computer Society, pp. 233–240. Franco Cicirelli achieved a PhD in computer science from the University of Calabria (Unical), DEIS—department of electronics informatics and systems science. As a postdoc, he is making research on agent and service paradigms for the development of distributed systems, parallel simulation, Petri nets, distributed measurement systems. He holds a membership with ACM. Angelo Furfaro, PhD, is a computer science assistant professor at Unical, DEIS, teaching object-oriented programming. His research interests are centred on: multi-agent systems, modeling and analysis of time-dependent systems, Petri nets, parallel simulation, verification of real-time systems, distributed measurement systems. He is a member of ACM. Libero Nigro is a full professor of computer science at Unical, DEIS, where he teaches object-oriented programming, software engineering and real-time systems courses. He directs the Software Engineering Laboratory (www.lis.deis.unical.it). His current research interests include: software engineering of time-dependent and distributed systems, real-time systems, Petri nets, modeling and parallel simulation of complex systems, distributed measurement systems. Prof. Nigro is a member of ACM and IEEE.     

ARTK-M2: A kernel for Ada tasking requirements: An implementation and an automatic generator

A run-time kernel, ARTK-M2, supporting Ada tasking semantics is discussed; full support for task creation, synchronization, communication, scheduling, and termination is provided, together with all options of the Ada rendezvous. An implementation in Modula-2 is presented and a method for automatically translating Ada programs into semantically equivalent Modula-2 programs with corresponding kernel calls is introduced. A parser generator and an attribute grammar were used for the automatic translation. A subset of the Ada Compiler Validation Capability was processed to test the implementation and to illustrate the translation mechanism. The kernel is applicable to the study of real-time control systems; it can also serve as a baseline for studying implementation alternatives of Ada concepts, such as new scheduling algorithms, and for analysing new language constructs. Work is under way to implement some of the changes to the Ada tasking model being proposed as a result of the language revision (Ada9X). Finally, through proper extensions, ARTK-M2 can form an integral part of programming tools such as an Ada compilation system and a distributed kernel for multi-processing environments.     

Ada95语言评述

Ａｄａ９５语言是在Ａｄａ８３基础上修订而成的，它几乎提供了现代程序设计范型及程序设计实践所需要的一切设施，它可以支持面向对象的程序设计、大型程序设计、实时与并行程序设计等等。     

Feasibility of piecewise-constant control sequences for timed continuous Petri nets

In this study, the determination of control actions for timed continuous Petri nets is investigated by the characterisation of attractive regions in marking space. In particular, attraction in finite time, which is important for practical issues, is considered. Based on the characterisation of attractive regions, the domain of admissible piecewise constant control actions is computed, and sufficient conditions to verify the feasibility of the control objectives are proposed. As a consequence, an iterative procedure is presented to compute piecewise constant control actions that correspond to local minimum time control for timed continuous Petri nets.     

Queueing Petri nets with product form solution

The product form results recently published for stochastic Petri nets are combined with the well-known product form results for queueing networks in the model formalism of queueing Petri nets yielding the class of product form queueing Petri nets. This model class includes stochastic Petri nets with product form solution and BCMP queueing networks as special cases. We introduce an arrival theorem for the model class and present an exact aggregation approach extending known approaches from queueing networks.