James L. Peterson. Petri Nets. ACM Computing Surveys, 9(3), September 1977. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Automating the Discovery and Modeling of Open Source.. - Chris Jensen And (Correct)
....or clearly superior. Nonetheless, contemporary research in software process technology, such as Lil Jil [2] and PML [8] argues for graphical or visual navigation representations of software processes. While graphical process representation schemes such as Petri Nets date back to the 1970 s [10] with a wide variety of activity and state chart diagrams in between, it appears they still suffer from a lack of scalability when applied to a process of any reasonable complexity. Cook [3, 4] utilized both algorithmic and statistical inference techniques with an ultimate goal was to create a ....
Peterson, James L. Petri Nets, ACM Computing Surveys (CSUR) September 1997, Volume 9 Issue 3
Scenario Networks for Software Specification and Scenario.. - Alspaugh, Anton (2001) (Correct)
....that are most relevant to scenario networks: Petri nets, high level message sequence charts, and extended finite state machines. A Petri net is a directed graph with two kinds of nodes, places and transitions, and with arcs that run either from places to transitions or from transitions to places [33]. If an arc runs from a node c to another node d (whether a place or transition) then c is said to be an input to d, and d an output from c. The state of the Petri net is indicated by the presence of tokens in one or more places, and a token moves from one place to another when a transition ....
....are occupied by tokens, and when a transition fires all of its output places receive tokens. Thus, concurrency is inherent in Petri nets and they are particularly useful in modelling concurrent systems. Petri nets are supported by almost four decades of research and a number of software tools [33]. The structure of Petri nets does not map to the structure of the systems they describe or the problems they solve, however, so it can be di#cult to trace a feature of a Petri net to a feature of a description of the system in another form. High Level Message Sequence Charts (HMSCs) are a ....
James L. Peterson, "Petri nets," ACM Computing Surveys, vol. 9, no. 3, pp. 223--252, Sept. 1977.
Synchronized Statecharts For Reactive Systems - Jo Josi Neto (1998) (Correct)
....reported, and a simplified real world example is used to illustrate the use of this tool. Keywords: statecharts, reactive systems, synchronisation, modelling INTRODUCTION Statecharts, as introduced by Harel [l] make an excellent graphical notation for describing reactive systems. Petri Nets [2] are also used as a good tool for analysis and design of synchronised processes. While statecharts, as a higher level notation, tend to hide lowlevel temporal details of the described phenomena, with Petri Nets the representation of functional aspects of the process is not immediate. In many ....
PETERSON, J. L. Petri nets. Computer, v.9, n.3, p.224-252, Sept. 1997.
Translating UAN into CSP - MacColl, Carrington (2000) (Correct)
....#### # ###### # #### ######## # #### 8. Conclusion In this paper we have presented a systematic translation from the task notation of UAN to the process algebra CSP. We are only aware of one other attempt to formalise UAN. Palanque et al. 13, 14] provide a translation of UAN into Petri nets [16], a state based, graphical notation for describing concurrent systems. Their approach includes the UAN waiting and concurrency constructs since they are using a timed variant, and true concurrency can be represented in Petri nets. However, the use of Petri nets is also the main drawback of their ....
J. L. Peterson. Petri nets. ACM Computing Surveys, 9(3):223--252, Sept. 1977.
The Use of Petri Nets for the Design and.. - Kondratyev.. (1998) (2 citations) (Correct)
....and Veri cation of Asynchronous Circuits and Systems Alex Kondratyev Jordi Cortadella Univ. Politecnica de Catalunya Barcelona, Spain Michael Kishinevsky Luciano Lavagno Politecnico di Torino 10129 Torino, Italy Alexander Taubin Aizu Wakamatsu, 965 80 Japan Abstract Petri nets [46, 37, 45, 48] are a powerful formalism for modeling concurrent systems. They are capable of implicitly describing a vast state space by a succinct representation which gracefully captures the notions of causality, concurrency and con ict between events. Petri nets have also been chosen by many authors as a ....
J. L. Peterson. Petri Nets, volume 9. ACM Computing Surveys, No. 3, September 1977.
Discovering Models of Behavior for Concurrent Systems - Cook, Du, Liu, Wolf (2002) (Correct)
....to achieve a goal, are not totally independent. In addition to being created and destroyed, they will synchronize at certain points, and this will be re ected in the sequences of events produced. In this paper, example models of concurrent systems are given in the familiar Petri net formalism [18]. The separate threads of execution in Petri net models are visible from the connectedness of the places and transitions. Events are produced at transition rings; the sequence of events pro2 C P2 P3 B P4 A Figure 1: An Example Petri Net. duced by the system is exactly the sequence of ....
J. Peterson. Petri Nets. ACM Computing Surveys, 9(3):223-252, Sept. 1977.
Processes Using a Multiagent Architecture - Por Ing Cesar (2005) (Correct)
No context found.
James L. Peterson. Petri Nets. ACM Computing Surveys, 9(3), September 1977.
Multiagent Architecture for Decentralized Workflow - Process Execution Csi-Ri- (2005) (Correct)
No context found.
James L. Peterson. Petri nets. ACM Computing Surveys, 9(3), September 1977.
A Formal Foundation for Workflow Composition, Workflow View .. - Pankratius, Stucky (Correct)
No context found.
Peterson, J. L. (1977), `Petri nets', ACM Comput.
Timed State Space Analysis of Real Time Preemptive Systems - Bucci, Fedeli, Sassoli.. (Correct)
No context found.
J.L.Peterson, \Petri Nets", ACM Computing Surveys, Vol.9, No.3, Sept.1977.
Automating the Discovery and Modeling of Open Source.. - Chris Jensen And (Correct)
No context found.
Peterson, James L. Petri Nets, ACM Computing Surveys (CSUR) September 1997, Volume 9 Issue 3
Static Analysis and Dynamic Steering of Time-Dependent Systems - Vicario (1998) (5 citations) (Correct)
No context found.
J.L.Peterson, \Petri Nets", ACM Computing Surveys, Vol.9, No.3, Sept.1977.
Generic and Domain-Specific Model Refactoring using a Model.. - Zhang, Lin, Gray (Correct)
No context found.
J. L. Peterson, "Petri Nets," ACM Computing Surveys, September 1977, pp. 223-252.
Investigating Ontologies for Simulation Modeling - Miller, Baramidze, Sheth.. (Correct)
No context found.
J.L. Peterson, \Petri Nets," ACM Computing Surveys, Vol. 9, pp. 223-252.
The Need for a Discrete-Event Modeling Ontology - Miller, Baramidze, Sheth.. (2003) (Correct)
No context found.
J.L. Peterson, "Petri Nets," ACM Computing Surveys, Vol. 9, pp. 223--252.
Hermes: A scalable event-based middleware - Pietzuch (2004) (2 citations) (Correct)
No context found.
James L. Peterson. Petri Nets. ACM Computing Surveys, 9(3):223--252, September 1977.
Efficient BDD-Based Planning for Non-Deterministic.. - Jensen (2003) (Correct)
No context found.
J. L. Peterson. Petri nets. ACM Computing Surveys, 9(3), 1977.
Model Refactoring with an Aspect-Oriented Model.. - Zhang, Lin, Gray (Correct)
No context found.
J. L. Peterson, "Petri Nets," ACM Computing Surveys, September 1977, pp. 223-252.
A Data-centric Approach to Composing Embedded.. - Wuyts, Ducasse.. (Correct)
No context found.
J. L. Peterson. Petri nets. ACM Computing Surveys, 9(3), 1977.
E-Services: A Look behind the Curtain - Hull, Benedikt, Christophides, Su (2003) (1 citation) (Correct)
No context found.
J.L. Peterson. Petri nets. ACM Comp. Surveys, 9(3):223--251, 1977.
Discovering Models of Behavior for Concurrent Workflows - Cook, Du, Liu, Wolf (2004) (Correct)
No context found.
J. Peterson, Petri Nets, ACM Computing Surveys 9 (3) (1977) 223--252.
Event-Based Detection of Concurrency - Jonathan Cook Alexander (1998) (29 citations) (Correct)
No context found.
J.L. Peterson. Petri Nets. ACM Computing Surveys, 9(3):223--252, September 1977.
Performance Analysis of Distributed Real-Time Databases - Fricks, Puliafito, Trivedi (1998) (Correct)
No context found.
James L. Peterson. Petri nets. Comp. Surv., 9(3):223-- 252, September 1977.
Chapter 11 - Markov Renewal Theory (Correct)
No context found.
J.L. PETERSON, "Petri Nets," Computing Surveys, 9, 223--252 (1977).
A Model for Secure Multimedia Document Database.. - Joshi, Li, Fahmi.. (2002) (Correct)
No context found.
J. Peterson, "Petri-nets," Comput. Surv., vol. 9, pp. 223--252, 1977.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC