共查询到20条相似文献,搜索用时 46 毫秒
1.
Kramer B. Luqi Berzins V. 《IEEE transactions on pattern analysis and machine intelligence》1993,19(5):453-477
The formal semantics of a prototyping language for hard real-time systems, PSDL, is given. PSDL provides a data flow notation augmented by application-orientation timing and control constraints to describe a system as a hierarchy of networks of processing units communicating via data streams. The semantics of PSDL are defined in terms of algebraic high-level Petri nets. This formalism combines algebraic specifications of abstract data types with process and concurrency concepts of Petri nets. Its data abstraction facilities are used to define the meaning of PSDL data types, while high-level Petri nets serve to model the casual and timing behavior of a system. The net model exposes potential concurrency of computation and makes all synchronization needs implied by timing and control constraints explicit and precise. Time is treated as state of clocks, and clocks are modeled as ordinary system components. The net semantics provides the basis for applying analysis techniques and semantic tools available for high-level Petri nets 相似文献
2.
As knowledge-based system technology gains wider acceptance, there is an increasing need to verify knowledge-based systems to improve their reliability and quality. Traditionally, attention has been given to verifying knowledge-based systems at the knowledge level, which only addresses structural errors such as redundancy, conflict and circularity in rule bases. No semantic errors (such as inconsistency at the requirements specification level) have been checked. In this paper, we propose the use of task structures for modeling user requirements and domain knowledge at the requirements specification level, and the use of high-level Petri nets for expressing and verifying the task structure-based specifications. Issues in mapping task structures onto high-level Petri nets are identified, e.g. the representation of task decomposition, constraints and the state model; the distinction between the "follow" and "immediately follow" operators; and the "composition" operator in task structures. The verification of task structures using high-level Petri nets is performed on model specifications of a task through constraint satisfaction and relaxation techniques, and on process specifications of the task based on the reachability property and the notion of specificity 相似文献
3.
Timed high-level nets 总被引:2,自引:1,他引:1
Petri nets have been widely used for modeling and analyzing concurrent systems. Several reasons contribute to their success: the simplicity of the model, the immediate graphical representation, the easy modeling of asynchronous aspects, the possibility of reasoning about important properties such as reachability, liveness, boundedness. However, the original model fails in representing two important features: complex functional aspects, such as conditions which rule the flow of control, and time. Due to that, two different classes of extensions of Petri nets have been proposed: high-level nets and timed Petri nets. High-level nets allow the representation of functional aspects in full details, but do not provide a means for representing time; on the other hand, timed Petri nets have been thought for time representation, but they do not provide a means for representing detailed functinal aspects. Thus, these two important aspects cannot be mastered together. In particular, it is difficult to express relationships between time and functional aspects.This paper investigates the relationships between high-level nets and timed Petri nets, thus extending a first set of results published in a previous paper, where a unifying Petri net based model for time representation has been proposed. It first recalls how time can be represented in a Petri net extension called ER nets, and assesses its generality. It then investigates the relationships of ER nets with the best known high-level nets. In particular it shows the overall equivalence of ER nets, Colored Petri nets and Predicate/Transition nets, and extends the mechanism for time representation introduced in ER nets to both Colored Petri nets and Predicate/Transition nets. It also shows that these models cannot be simplified without significantly constraining the timing aspects that can be modeled. 相似文献
4.
Petri nets have the basic concepts necessary to model distributed systems with asynchronous processes. Petri nets are not directly applicable to certain kinds of systems like distributed intelligent systems (DISs). These are complex systems where multiple intelligent agents cooperate through communication to achieve the solution to a problem. The paper identifies the limitations of ordinary Petri nets for modeling DISs and proposes extensions. The extended Petri net incorporates colored tokens, inhibition arcs, non-primitive places and transitions, multiple copies of tokens and cumulative places. It is called a distributed problem-solving Petri net. The definitions and analysis techniques are given and illustrated by means of an example. 相似文献
5.
Billington J. Wheeler G.R. Wilbur-Ham M.C. 《IEEE transactions on pattern analysis and machine intelligence》1988,14(3):301-316
The PROTEAN protocol emulation and analysis computer aid is presented. It is based on a formal specification technique called numerical Petri nets (NPNs), and provides both graphical (color) and textual interfaces to the protocol designer. NPN specifications may be created, stored, appended to other NPNs, structured, edited, listed, displayed, and analyzed. Interactive simulation, exhaustive reachability analysis, and several directed graph analysis facilities are described. Specification languages are compared, with concentration on extended finite state machines and high-level Petri nets. Both the NPN and PROTEAN facilities are described and illustrated with a simple example. The application of PROTEAN to complex examples is mentioned briefly. Work towards a comprehensive protocol engineering workstation is also discussed 相似文献
6.
Oliver Shaw Jason Steggles Anil Wipat 《Electronic Notes in Theoretical Computer Science》2006,151(3):111-129
Stochastic simulations are able to capture the fine grain behaviour and randomness of outcome of biological networks not captured by deterministic techniques. As such they are becoming an increasingly important tool in the biological community. However, current efforts in the stochastic simulation of biological networks are hampered by two main problems: firstly the lack of complete knowledge of kinetic parameters; and secondly the computational cost of the simulations. In this paper we investigate these problems using the framework of stochastic Petri nets. We present a new stochastic Petri net simulation tool NASTY which allows large numbers of stochastic simulations to be carried out in parallel. We then begin to address the important problem of incomplete knowledge of kinetic parameters by developing a distributed genetic algorithm, based on NASTY's simulation engine, to parameterise stochastic networks. Our algorithm is able to successfully estimate kinetic parameters to replicate a system's behaviour and we illustrate this by presenting a case study in which the kinetic parameters are derived for a stochastic model of the stress response pathway in the bacterium E.coli. 相似文献
7.
The synthesis problem for Petri nets consists in deciding constructively the existence of a Petri net with sequential state
graph isomorphic to a given graph. If events are attached to locations, one may set as an additional requirement that the
synthesised net should be distributable; i.e. such that events at different locations have no common input place, whence distributed
conflicts are avoided. Distributable nets are easily implemented by finite families of automata (one per location) communicating
with each other by asynchronous message passing. We show that the general Petri net synthesis problem and its distributed
version may both be solved in time polynomial in the size of the given graph. We report on some preliminary experiments of
Petri net synthesis applied to the distribution of reactive automata using the tool SYNET.
Received November 2000 / Accepted in revised form August 2001 相似文献
8.
9.
10.
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. 相似文献
11.
《Information and Software Technology》2002,44(8):473-489
Petri nets have been extensively used in the modelling and analysis of concurrent and distributed systems. The verification and validation of Petri nets are of particular importance in the development of concurrent and distributed systems. As a complement to formal analysis techniques, testing has been proven to be effective in detecting system errors and is easy to apply. An open problem is how to test Petri nets systematically, effectively and efficiently. An approach to solve this problem is to develop test criteria so that test adequacy can be measured objectively and test cases can be generated efficiently, even automatically. In this paper, we present a methodology of testing high-level Petri nets based on our general theory of testing concurrent software systems. Four types of testing strategies are investigated, which include state-oriented testing, transition-oriented testing, flow-oriented testing and specification-oriented testing. For each strategy, a set of schemes to observe and record testing results and a set of coverage criteria to measure test adequacy are defined. The subsumption relationships and extraction relationships among the proposed testing methods are systematically investigated and formally proved. 相似文献
12.
This volume contains selected papers of the proceedings of the workshop on Uniform Approaches to Graphical Process Specification Techniques (UNIGRA'03). The workshop was held in Warsaw, Poland, on April 5 and 6, 2003, as a satellite event of the sixth European Joint Conference on Theory and Practice of Software (ETAPS 2003). The workshop continues the UNIGRA workshop in 2001 which has been a successful satellite event of ETAPS 2001.Workshop ObjectivesDue to the increasing amount of divergent formalisms, the main idea of the UNIGRA workshops is to bring together people working especially in the following three areas:
- • Low Level and High-Level Petri Nets
- • Graph Transformation and High-Level Replacement Systems
- • Visual Modeling Techniques including UML
- • Hartmut Ehrig (TU Berlin, Germany) [chair]
- • Roswitha Bardohl (TU Berlin, Germany) [co-chair]
- • Luciano Baresi (University of Milano, Italy)
- • Paolo Bottoni (University of Pisa, Italy)
- • Claudia Ermel (TU Berlin, Germany)
- • Reiko Heckel (University of Paderborn, Germany)
- • Dirk Janssens (University of Antwerp, Belgium)
- • Stuart Kent (University of Kent, Great Britain)
- • Hans-Jörg Kreowski (University of Bremen, Germany)
- • Fernando Orejas (University of Catalunya, Espania)
- • Julia Padberg (University of Bremen, Germany)
- • Grzegorz Rozenberg (University of Leiden, The Netherlands)
13.
Muro-Medrano P.R. Banares J.A. Villarroel J.L. 《IEEE transactions on systems, man, and cybernetics. Part A, Systems and humans : a publication of the IEEE Systems, Man, and Cybernetics Society》1998,28(2):183-198
This paper presents knowledge representation-oriented nets (KRON), a knowledge representation schema for discrete event systems (DES). KRON enables the representation and use of a variety of knowledge about a DES static structure and its dynamic states and behavior. It is based on the integration of high-level Petri nets with frame-based representation techniques and follows the object-oriented paradigm. The main objective considered in its definition is to obtain a comprehensive and powerful representation model for data and control of DES. The use of the DES behavioral knowledge is governed by a control mechanism stored in a separate inference engine. KRON provides an efficient execution mechanism to make the models evolve. This is an adaptation of the RETE matching algorithm in order to deal with the features provided by high-level Petri nets and it takes advantage of its integration with a frame/object-oriented representation schema, Moreover, KRON facilitates dealing with decision points in the execution of nondeterministic models. A prototype of a simulation tool with graphical display and animation facilities has been implemented for KRON and it has been used in several case studies in the manufacturing systems domain 相似文献
14.
15.
A conceptual framework for the integration of data type and process modeling techniques, called integration paradigm, has been presented by the authors in previous papers already. The aim of this paper is to give a short review of this conceptual framework and to present a formal model for the integration paradigm. The formal model for the four layers, called data type, data states and transformations, processes and system architecture layers respectively, is based on an integration of abstract data types and structured transition systems. This formal model can be instantiated by all kinds of basic and integrated modeling techniques. Algebraic high-level nets, attributed graph transformation, an integration of Z with statecharts, and some diagram techniques of UML are discussed on the conceptual level. As instantiation of the formal model, a well-known CCS sender specification, place/transition nets, algebraic high-level nets and attributed graph transformation are presented in this paper, while instantiations of other modeling techniques will be discussed elsewhere. 相似文献
16.
Stochastic extensions to Petri nets have gained widespread acceptance as a method for describing the dynamic behavior of discrete-event
systems. Both simulation and analytic methods have been proposed to solve such models. This paper describes a set of efficient
procedures for simulating models that are represented as stochastic activity networks (SANs, a variant of stochastic Petri
nets) and composed SAN-based reward models (SBRMs). Composed SBRMs are a hierarchical representation for SANs, in which individual
SAN models can be replicated and joined together with other models, in an iterative fashion. The procedures exploit the hierarchical
structure and symmetries introduced by the replicate operation in a composed SBRM to reduce the cost of future event list
management. The procedures have been implemented as part of a larger performance-dependability modeling package known asUltraSAN, and have been applied to real, large-scale applications.
This work was supported in part by the Digital Equipment Corporation Faculty Program: Incentives for Excellence. 相似文献
17.
统一建模型语言(UML)已经成为软件系统的分析与设计的标准工具,但由它扩充而成的代理统一建模型语言(AUML)还没变成一个标准,目前的AUML规格说明还有很多的局限性,还不能胜任多代理系统的开发.Petri网是仿真、验证软件系统执行的正确性与有效性的形式化工具.本文主要分析当前AUML规格说明和Petri网概念.找出它们之间的结合点,提出用Petri网扩充AUML的方法.将其应用于多代理系统的开发,就能实施之前运用Petri网进行系统的正确性与有效性验证. 相似文献
18.
INCOME/STAR: Methodology and tools for the development of distributed information systems 总被引:1,自引:0,他引:1
INCOME/STAR is an experimental environment for the cooperative development of distributed information systems. This paper presents some of INCOME/STAR's innovative features in the area of information systems engineering: First a new type of high-level Petri nets, so-called Nested Relation/Transition nets (NR/T-nets), is described. NR/T-nets allow the modeling of concurrent processes and related complex structured objects in distributed business applications. New concepts for entity and relationship clustering were developed to support a stepwise top-down approach for Entity/Relationship based object modeling. Distributed multi-user simulation and prototyping are used for the evaluation and analysis of NR/T-nets and the involved object schema. Finally, ProMISE — an evolutionary process model for information system development — is introduced. A role-based groupware component is part of the INCOME/STAR architecture to support communication, organization and social interaction in development projects. 相似文献
19.
We propose a finite structural translation of possibly recursive π-calculus terms into Petri nets. This is achieved by using high-level nets together with an equivalence on markings in order to model entering into recursive calls, which do not need to be guarded. We view a computing system as consisting of a main program (π-calculus term) together with procedure declarations (recursive definitions of π-calculus identifiers). The control structure of these components is represented using disjoint high-level Petri nets, one for the main program and one for each of the procedure declarations. The program is executed once, while each procedure can be invoked several times (even concurrently), each such invocation being uniquely identified by structured tokens which correspond to the sequence of recursive calls along the execution path leading to that invocation. 相似文献
20.
A dynamic Petri net model for iterative and interactive distributed multimedia presentation 总被引:2,自引:0,他引:2
Object Composition Petri Nets, Priority Petri Nets, Dynamic OCPN, and Enhanced P-Nets have extended the original Petri Net to achieve the modeling of media synchronization and asynchronous user interactions during multimedia playback. The dynamic Petri Net (DPN) has been conceptualized to tackle existing problems in these two areas of modeling distributed multimedia systems. DPN features dynamic modeling elements which allows iteration and hence is able to reduce graph sizes of synchronous playback models while allowing greater details to be shown. DPN also introduces asynchronous event handling techniques that are powerful and effective. DPN was used in the design and modeling of a multimedia orchestration tool which is a typical representation of an application that works in a distributed multimedia system. 相似文献