W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Orchestrating Transactions in Join Calculus - Roberto Bruni Cosimo (2002) (4 citations) (Correct)
....union) end shapes are regarded as stable places (a sort of entry exit points) This second step is illustrated in Figure 2(c) for the flowchart in Figure 2(a) where channels are considered transactional. The semantics of the net in Figure 2(c) departs from the standard one for Petri nets [15] because of transactions. In Petri nets, places are repositories of resources, called tokens, and transitions fetch and release resources. Zerosafe nets have been introduced in [3] as a suitable transactional flavour of Petri nets: places are partitioned into ordinary and transactional ones ....
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
Mark Drummond - Sterling Federal Systems (Correct)
....and SCRs This section defines and explains plan nets and SCRs. Examples drawn from the BNL problem are scattered throughout. The first few subsections simply define plan nets and the formal machinery needed to do temporal projection. 4. 1 Plan Nets A plan net is a type of Condition Event system (Reisig, 1985), essentially, a specific sort of Petri Net. A plan net is a bipartite directed graph built from two types of nodes called conditions and operators. Conditions are facts about the agent s environment that can be true or false (equivalently: can hold or not hold) Operators denote events. The arcs ....
Wolfgang Reisig Petri Nets: an Introduction. Springer-Verlag, EATCS Monographs on Theoretical Computer Science, Volume 4, 1985.
Preserving Liveness with Rule-Based Refinement . . . - Urbasek (2002) (Correct)
....specification techniques for the description of the operational behavior of a system. Petri nets have a long and successful history and are by now widely used in various application domains. In this paper we employ one of the most basic Petri net formalisms, namely place transition nets (see e.g. [Rei85]) We aim at a more powerful and descriptive technique for the refinement and stepwise development of place transition nets. Place transition nets themselves are not fully adequate for modeling systems in practice, but the basic ideas apply to high level Petri nets as well. Refinement of nets in ....
....project DFG Forschergruppe PETRINETZ TECHNOLOGIE between H. Weber (Coordinator) H. Ehrig (both from the Technical University Berlin) and W. Reisig (HumboldtUniversit at zu Berlin) supported by the German Research Council (DFG) paper we use the usual Petri net notion of liveness as e.g. in [Rei85] and not the notion of liveness properties as used in temporal logic, e.g. MP92] Lam94] Liveness is one of the most important concepts for the description of the operational behavior of a net. Liveness states the fact that in a net al..l transitions can become enabled from all reachable ....
W. Reisig. Petri nets, Vol. 4 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
Decomposition in Asynchronous Circuit Design - Vogler, Wollowski (2002) (Correct)
....Section 6. 2 Basic Notions of Signal Transition Graphs In this section, we introduce the kind of Petri nets we study in this paper, some standard behaviour notions, and the operation of parallel composition. For general information on ordinary Petri nets, the reader is referred to e.g. Pet81, Rei85] A Signal Transition Graph or STG is a net that models the desired behaviour of an asynchronous circuit. Its transitions are labelled with signals from some alphabet or with the empty word , and we distinguish between input and output signals. A transition labelled with represents an ....
W. Reisig. Petri Nets. EATCS Monographs on Theoretical Computer Science 4. Springer, 1985.
Structural Operational Semantics - Aceto, Fokkink, Verhoef (1999) (15 citations) (Correct)
....between program states are the main objects of study in this form of semantics. This terminology, albeit more descriptive in this context than structural or Plotkin style , has the drawback of being applicable to a range of operational semantics such as those for automata and Petri nets [184] that are rather different in nature from those that we deal with in this chapter. In [110, 111] Groote and Vaandrager used the acronym SOS to stand for Structured Operational Semantics. Their aim was to emphasize that a transition system specification that leads to a transition system for ....
W. Reisig, Petri nets -- an introduction, EATCS Monographs on Theoretical Computer Science, Volume 4, Springer-Verlag, 1985. 123
An Examination of Requirements Specification Languages - Tse, Pong (1991) (2 citations) (Correct)
....understanding and the symbolic form SEDDA is for computer processing. The former is in fact identical to SADT. An example of the latter is shown in Figure 4. Since the two forms have corresponding syntaxes and identical semantics, one can easily be transformed into the other. An extended Petri net [28, 29] is used as the mathematical model for the formal semantic definition. Transitions in Petri nets correspond to activities in SADT, and places in Petri nets correspond to data items. To support the complex structure of SADT, EDDA extends the Petri net concept to include predicates and coloured ....
W. Reisig, Petri Nets: an Introduction, EATCS Monographs on Theoretical Computer Science, vol. 4, Springer, Berlin (1985).
Attacking Symbolic State Explosion - Delzanno, Raskin, Van Begin (4 citations) (Correct)
....of the CST for the xpoint; Ratio of memory saving (using CSTs) RM=MAX N (MAX E P) in pct. RN=NN (NE P) in pct. Fig. 6. Parameters of the experimental evaluation. to the 3x2 case, the CSM of [ABC 95] Fig. 76, p. 154) and for an extension of the Readers Writers example given in [Rei86] in which we use several bu ers with 45 slots. Furthermore, we have considered semi liveness and coverability problems for the PNCSA communication protocol analyzed in [BF99,Fin93] The experimental results are listed in Fig. 7. We performed every example either enabling or disabling the ....
W. Reisig. Petri Nets. An introduction. EATCS Monographs on Theoretical Computer Science, Springer 1986.
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 ....
W. Reisig. Petri Nets: an Introduction. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1985.
The Probabilistic Asynchronous π-Calculus - Herescu (2002) (7 citations) (Correct)
....basis for the specification of concurrent systems, and includes formalisms for modelling, expressing properties, validation and verification of such systems. The history of the theory of concurrency started more than thirty years ago. Various models of communicating systems, such as Petri nets [44], CSP [13] ACP [2] CCS [24, 25] the # calculus ( 27] have been proposed since then. Robin Milner s invention of the Calculus of Communicating Systems (CCS) was a cornerstone in the history of theory of concurrency. CCS deals with interactive systems which are not mobile and was designed to ....
W. Reisig. Petri nets. EATCS Monographs on Theoretical Computer Science, 1983.
Integrating and Rapid-Prototyping UML Structural and.. - Aoumeur, Saake (2002) (Correct)
....stepco nsists in intrinsicallyinco rpo rating in these diagrams the dynamics o each o eratio n instead o (o r after) describing them separately using OCL descriptio ns. In the endeavo rto achieve this crucial step,we pro po se to add new semi graphical no atio ns we bo rro w fro Petri netso nes [Rei85].Mo re precisely, with respectto o uro bjectiveo f enhancing scalability andco mpo nent o rientatio n, first,we present ho w class diagrams behavio r is co ceptualized,and then we deal with the behavio ur go uverning the interactio n between independent classdiagrams co po sing the who le ....
W. Reisig. Petri Nets. EATCS Monographs an Theoretical Computer Science, 4, 985. 302
NOODLE++: a 3-dimensional net-based object-oriented development.. - Tse, Cheng (1996) (Correct)
....to newly defined nets. h) The instantiation of objects requires specific class definitions to be extracted from a class hierarchy. This can be supported by the concept of sectioning in net theory. 3 The NOODLE Model 3. 1 Classes We specify a class by an extended predicate transition net [15] , which has both graphical and algebraic representations with equivalent semantics. For example, the graphical representation of the class Account is shown in Figure 1. A method such as credit is specified as a transition, which is denoted by a bar. It is connected to incoming message paths ....
Reisig W. Petri nets: an introduction. Springer-Verlag, Berlin, 1985 (EATCS Monographs on Theoretical Computer Science, Vol. 4)
Debugging Multi-Agent Systems Using Design Artifacts.. - Poutakidis, Padgham.. (2002) (5 citations) (Correct)
....= Interaction Protocol) For the above reason we require that the agents are aware of the conversations that they are engaged in, therefore each message must belong to a particular conversation, hence the conversation id. The debugging agent represents protocol instances internally as Petri nets [20]. We choose to do this, rather than use AUML, for two reasons. Firstly, Petri nets are a precise notation with clear formal semantics whereas AUML is not precisely defined. Secondly, by using a general underlying protocol representation which is decoupled from AUML we allow ourselves to use other ....
....algorithms (and tools ) for checking for various properties (deadlock, liveness, etc. of Petri nets and given an AUML protocol we could translate it to a Petri net then check its properties. 4. 1 Petri Nets We briefly introduce the Petri net notation (named after Carl Adam Petri) A Petri net [20] consists of places (depicted as circles) and transitions (depicted as rectangles) which are linked by arrows. Additionally, places may contain tokens (depicted by . The placement of tokens on a net is its marking and executing ( firing ) a Petri net consists of moving tokens around according ....
Wolfgang Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985. ISBN 0-387-13723-8.
Flip-Tick Architecture: a cycle-oriented architecture for.. - Richter (1998) (Correct)
....performed by all actors of the ensemble between getting control and returning control. B From elementary to high level Petri nets We assume that the reader is familiar with elementary Petri nets where places do not carry more than one token (usually represented with a black dot in the circle) [12]. The following introduction recalls the basics of condition event modeling with Petri nets and shows how to relate elementary and high level nets. In elementary PN diagrams, a condition is modeled with a place drawn as a round symbol 2 (usually a circle) If the diagram is executable, a movable ....
W. Reisig. Petri Nets. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin Heidelberg, 1985. 161 pages.
Algebraic Prototyping Tools for Petri Nets with Time - Steggles (2002) (Correct)
....with a ring interval and timed Petri nets in which a ring delay is associated with transitions. In each case we demonstrate the exibility of our approach by examining a range of semantic choices detailed in the literature. 1 Introduction. The theory of Petri nets (see for example [17] [19] and [16] provides a graphical notation with a formal mathematical semantics for modelling and reasoning about concurrent, distributed systems. One shortcoming of basic Petri nets is that they do not provide any insight into the time behaviour of systems. For real time systems such as protocols ....
....by its current marking and thus the state space of a Petri net is the set of all possible markings [P N] only some of which may be reachable) Clearly ring an enabled transition corresponds to a state transition in a Petri net. For a more detailed introduction to Petri nets we recommend [17] [19] and [16] 2.2 Rewriting Logic. Rewriting logic (RL) is an extension of standard algebraic speci cation techniques which is able to model dynamic system behaviour. In RL the functional and static properties of a system are described by a standard algebraic speci cation, whereas the dynamic ....
W. Reisig. Petri nets { an introduction. EATCS Monographs in Theoretical Computer Science, 4, Springer{Verlag, 1985.
Implementation of Parameterized Petri Net Classes with the.. - Ermel, Weber (2000) (Correct)
....of formal parameters with actual parameters, we refer the reader to Appendix A. Parameters for Net Classes The net marking structure parameter is su cient to describe di erent low level net types. Several di erent low level net types have been proposed over the last 30 years, see for example [3,24,26]. Moreover, the developments in software industry have produced quite a large amount of variants that are equipped with additional features and or restrictions. We here review an abstraction of the net marking structure that can be instantiated to several low level net types, including ....
....pre; post : T P(P ) Each element m 2 P(P ) can be considered as a marking of the elementary net. The ring behaviour makes use of the order on sets and the operations union and complement on sets. These algebraic presentations [19] are equivalent to the classical presentations (see e.g. [24,7]) but have the advantage to be axiomatic, and thus simpler to generalize. Algebraic Presentation of the Data Type Parameter For a generalization of the di erent data type representation used in combination with Petri nets, the notion of institutions (see [11,27] is employed. Institutions ....
Reisig, Wolfgang: Petri Nets, vol. 4 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag. 1985.
Partial S-Invariants for the Verification of Infinite Systems.. - Vogler (2001) (Correct)
....Petri nets, which are extended with read arcs as explained in the introduction, and the basic ring rule. Then we de ne parallel composition, renaming and hiding for such nets and give some laws for these operations. For general information on ordinary Petri nets, the reader is referred to e.g. [Pet81, Rei85]. The transitions of our nets are labelled with actions from some in nite alphabet or with the empty word . In general, these actions are left uninterpreted; the labelling only indicates that two transitions with the same label from represent the same action occurring in di erent internal ....
W. Reisig. Petri Nets. EATCS Monographs on Theoretical Computer Science 4. Springer, 1985.
Operational Congruences for Reactive Systems - Leifer (2001) (18 citations) (Correct)
....input. Even though a and b have identical traces, their non deterministic behaviour is di#erent. Chapter 1. Introduction 4 The problem of handling non determinism together with causality (the dependence of one transition upon an earlier one) was first addressed by Petri nets (see, for example, Rei85] In its simplest form, a Petri net consists of a directed hypergraph whose nodes are called conditions and whose hyperedges are called events. A token may reside at a condition. When the preconditions of an event hold (i.e. there is a token on every condition that is a source of the event ....
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985. {4}
Marked Petri Nets within a Categorial Framework - Menezes (1995) Self-citation (Nets) (Correct)
No context found.
W. Reisig, Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science 4, Springer-Verlag, 1985.
Transformation of Open and Algebraic High-Level Petri Net Classes - Kolagari (2002) Self-citation (Reisig) (Correct)
....Motions. Wee haue also Houses of Deceits of the Senses; where wee represent all manner of Feats of Jugling, False Apparitions, Impostures, and Illusions; And their Fallaces. These are (my sonne) the Riches of Salomons House. Francis Bacon, New Atlantis. ed. Rawley, London 1627 nets [7] are a well known method for specifying concurrent systems. This is, according to the enumeration in [14] mostly due to: 1. its simplicity, in the sense that Petri net speci cations involve few but powerful concepts; 2. theoretical investigations that provide well de ned semantic models ....
....were introduced by C. A. Petri in his famous dissertation [3] Since then many researchers have worked on them from theoretical and practical points of view. In the rst twenty years, mostly low level nets were described, like, for example, elementary nets or place transition nets (see for example [7]) Category EN of Elementary Nets Elementary nets are very similar to the nets which were originally introduced by C. A. Petri which have, however, been modi ed. A good introduction to elementary nets is provided in [8] Category AHL of (Typed) Algebraic High Level Nets The rst high level nets ....
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science, Springer Verlag, 1985.
A theory of implementation and refinement in timed Petri.. - Felder, Gargantini.. (1998) (5 citations) Self-citation (Nets) (Correct)
....type Alw(#) then ##Alw (#) i.e. if the hypotheses under which a property is proved are not restricted to the present but hold at any time, then the derived property is also always true. 3. Timed Petri nets and their axiomatization in TRIO imed Petri nets [20] di#er from traditional Petri nets [25] in that every transition v is associated with a pair of values, usually denoted by [m ] belonging to the temporal domain (with 0)m )R ) These are called, respectively, the lower and upper bound of v, whereas the pair [m ] is called v s time interval. Intuitively, the meaning of ....
W. Reisig, Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1985.
Pre-Nets, Read Arcs and Unfolding: A Functorial Presentation - Baldan, Bruni, Montanari (2002) (Correct)
No context found.
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer, 1985.
Questions and Answers about Ten Formal Methods - Hartel, Butler, Currie.. (1999) (5 citations) (Correct)
No context found.
W. Reisig. Petri Nets---An Introduction, EATCS Monographs in Theoretical Computer Science, Vol 4. Springer-Verlag, Berlin, 1985.
Authorization Model for Strongly Distributed Information Systems - Cvrcek (2000) (Correct)
No context found.
Reisig, W.: Petri Nets: An Introduction, vol. 4 of EATCS monographs on Theoretical Computer Science. Springer, Berlin, Germany, 1985.
Performance Evaluation by Simulation - Hlavacs, Ueberhuber (2001) (Correct)
No context found.
Reisig, W.: Petri Nets{An Introduction. EATCS Monographs on Theoretical Computer Science 4. Springer-Verlag, Berlin Heidelberg NewYork 1985.
How to Formalize It? Formalization Principles for.. - Hofstede, Proper (1998) (Correct)
No context found.
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. SpringerVerlag, Berlin, Germany, 1985.
Extending the Zero-Safe approach to Coloured.. - Bruni, Melgratti.. (Correct)
No context found.
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
Partial Order and Contextual Net Semantics for.. - Bueno.. (2000) (4 citations) (Correct)
No context found.
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
Orchestrating Transactions in Join Calculus - Roberto Bruni Cosimo (2002) (4 citations) (Correct)
No context found.
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer, 1985.
Enhancing Commitment Machines - Winikoff, Liu, Harland (Correct)
No context found.
Wolfgang Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985. ISBN 0-387-13723-8.
The Theory of Finite-State Adventures - Brauer, Holzer, König, Schwoon (Correct)
No context found.
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1985.
Covering Sharing Trees: A Compact Data Structure for.. - Delzanno, Raskin, Van.. (Correct)
No context found.
W. Reisig. Petri Nets. An introduction. EATCS Monographs on Theoretical Computer Science, Springer, 1986.
Synthesising Labelled Transitions and Operational Congruences in.. - Leifer (2002) (7 citations) (Correct)
No context found.
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.
A Logic for Analyzing Abstractions of Graph Transformation.. - Baldan, König, König (2003) (3 citations) (Correct)
No context found.
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1985.
Centralized and Distributed Orchestration of.. - Bruni, Laneve, Montanari (Correct)
No context found.
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer, 1985.
Questions and Answers about Ten Formal Methods - Hartel, Butler, Currie.. (1999) (5 citations) (Correct)
No context found.
W. Reisig. Petri Nets---An Introduction, EATCS Monographs in Theoretical Computer Science, Vol 4. Springer-Verlag, Berlin, 1985.
Modelling and Validation of Tasks With Algebraic - Structured Nets Buchs (Correct)
No context found.
W. Reisig. Petri nets: an introduction. EATCS Monograph on Theoretical computer Science, Vol 4, Springer Verlag 1985.
Journal of the Brazilian Computer Society - Special Issue On (Correct)
No context found.
Reisig W., Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science 4, Springer-Verlag, 1985.
Bounded Decomposition of Stochastic Models - David Daly And (Correct)
No context found.
W. Reisig, Petri Nets: An Introduction, ser. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985, ch. 7, p. 101.
Initial Realization of the "Petri Net Baukasten" - Battke, al. (1999) (Correct)
No context found.
Reisig, Wolfgang: Petri Nets, vol. 4 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag. 1985.
Alea jacta est - Verification of Probabilistic, Real-Time and.. - Stoelinga (2002) (Correct)
No context found.
W. Reisig. Petri nets -- an introduction. EATCS Monographs on Theoretical Computer Science, Volume 4. Springer-Verlag, 1985.
Trust-By-Contract: Modelling, Analysing And Predicting.. - Schmidt, Poernomo.. (2001) (Correct)
No context found.
. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany.
Nonsequential Automata Semantics for a Concurrent.. - Menezes, Sernadas, Costa (1998) (2 citations) (Correct)
No context found.
Reisig, W., Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science 4, Springer-Verlag, 1985.
Refinement Mapping for - General Discrete Event (Correct)
No context found.
W. Reisig, Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science 4, Springer-Verlag, 1985.
Compositional Reification of Concurrent, Interacting Systems - Menezes (Correct)
No context found.
W. Reisig, Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science 4, Springer-Verlag, 1985.
Functorial Models for Contextual Pre-Nets - Bruni, Meseguer, Montanari.. (2002) (Correct)
No context found.
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
CSTs (Covering Sharing Trees): Compact Data Structures.. - Delzanno, Raskin, Van.. (Correct)
No context found.
W. Reisig. Petri Nets. An introduction. EATCS Monographs on Theoretical Computer Science, Springer 1986.
On Concurrent Realization of Reactive Systems - And Their Morphisms (Correct)
No context found.
W. Reisig. Petri Nets. EATCS Monographs in Theoretical Computer Science, vol. 4, Springer-Verlag, 1985.
Alea jacta est - Verification of Probabilistic, Real-Time and.. - Stoelinga (2002) (Correct)
No context found.
W. Reisig. Petri nets -- an introduction. EATCS Monographs on Theoretical Computer Science, Volume 4. Springer-Verlag, 1985.
Description and Verification of Mobile Processes with Graph.. - König (Correct)
No context found.
W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1985.
Executable Specifications with Data-Flow Diagrams - Fuggetta, Ghezzi.. (1993) (1 citation) (Correct)
No context found.
W. Reisig, Petri Nets. An Introduction, EATCS Monographs on Theoretical Computer Science, Springer Verlag, 1985.
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