19 citations found. Retrieving documents...
C.A. Petri (1977), Non-Sequential Processes. Interner Bericht ISF--77--5, Gesellschaft f ur Mathematik und Datenverarbeitung, Bonn. of Aarhus.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Trace Semantics for Actor Systems - Vasconcelos, Tokoro   (4 citations)  (Correct)

....after the appearance of Plotkin s method of Structured Operational Semantics [14] have been mostly developed with respect to Milner s Calculus of Communicating Processes [11] and other similar algebraic process languages. On the other hand, true concurrent models (including Petri nets [13], Winskel s event structures [12, 17] and Mazurkiewicz s traces [1] were primarily developed in relation to Petri nets. Meseguer s concurrent term rewriting logic [9] is another true concurrent model: it aims at describing a wide variety of concurrent systems. While there is some work done on ....

C.A. Petri. Non-sequential processes. GMD-ISF 77-S, Gesselschaft Math., Datenverarb. , St. Augustin, 1977.


Sequentiality vs. Concurrency in Games and Logic - Abramsky (2001)   (Correct)

.... exactly the sense in which it is asynchronous) be reconciled with the additives, which as we have seen are essentially concerned with choice and causality We can in fact characterize the behavioural features of the various levels of connectives in Linear Logic using the concepts of Net Theory [Pet77]: the multiplicatives express concurrency (i.e. pure causal independence) the additives express con ict and causality (i.e. choice and sequencing) This is of course just the true concurrency perspective on our previous alignment of the additives with the dynamic operations of process ....

C. A. Petri. Non-sequential processes. Technical report ISF-77-05, GMD-ISF, 1977.


Categorical Models for Concurrency: Independence, Fairness and.. - Hildebrandt (2000)   (Correct)

....trace languages [85, 86] synchronisation trees [141] and event structures [137, 142] are all examples of behavioral models. Models that allow an interpretation of repetition of system states are referred to as system models. The models of labelled transition systems [77] and Petri nets [106] are prime examples of such models. System models are most suited for giving operational semantics. The fact that a system model can o#er finite descriptions of systems with infinite behaviour is exploited in various techniques for model checking and automatic verification of reactive systems. ....

C.A. Petri. Non-sequential processes. Technical Report ISF-77-05, GMD-ISF, 1977.


On the Search for Tractable Ways of Reasoning about Programs - Jones (2001)   (8 citations)  (Correct)

....As mentioned at the beginning of this section, the work on parallel systems is quite diverse. One contentious issue that has emerged is the contrast between interleaving and true concurrency . The latter position is taken by Carl Adam Petri (b1926) and others working on Petri nets [Pet62, Pet76, Pet77] 56 4.2 Language semantics A separate historical paper on Language Semantics needs to be written but an outline of the major issues is given in this section. The study of languages can be partitioned into syntax , semantics and pragmatics ; Heinz Zemanek (b1920) applied this ....

C. A. Petri. Non-sequential processes. Technical Report ISF-77-05, GMD, Bonn, 1977. Translation of ISF-76-6.


Sequentiality vs. Concurrency in Games and Logic - Abramsky (2001)   (Correct)

.... exactly the sense in which it is asynchronous) be reconciled with the additives, which as we have seen are essentially concerned with choice and causality 1 We can in fact characterize the behavioural features of the various levels of connectives in Linear Logic using the concepts of Net Theory [Pet77]: the multiplicatives express concurrency (i.e. pure causal independence) the additives express con ict and causality (i.e. choice and sequencing) This is of course just the true concurrency perspective on our previous alignment of the additives with the dynamic operations of process ....

C. A. Petri. Non-sequential processes. Technical report ISF-77-05, GMD-ISF, 1977.


Concatenable weighted pomsets and their applications to.. - Winkowski (1996)   (Correct)

....Petri net, time Petri net, process, potential timed process, actual timed process. 1. Motivation The idea of representing behaviours of concurrent systems with the aid of partial orders has appeared to be fruitful. From one side, it has allowed to develop an adequate theory of Petri nets (cf. P 77] Maz 77] Wi 80] Wi 82] GR 86] DMM 89] for example) From the other side, it has allowed to reduce dramatically the computational complexity of practical analysis of concurrent systems (cf. GW 91] GK 91] Pe 93] PP 95] for example) The core of this idea is that all possible ....

Petri, C. A., Non-Sequential Processes, GMD, Report ISF-77-05, 1977


Non sequential semantics for contextual P/T nets - Busi, Pinna (1996)   (9 citations)  (Correct)

....place, need to be sequentialized in usual nets, whereas if the arcs are contextual ones, they may happen in the same step [9] in general they reduce the possible different run of the net, as they work as contexts. 3 Non sequential semantics Occurrence nets have been introduced by Petri in [10]. Starting from a partial order, where the partial order is intended to model the causal dependencies and the absence of order (disorder) reflects the concurrency, it is possible to define a net with some characteristics: places are unbranched (i.e. there is just one outgoing and one ingoing arc) ....

C. A. Petri, "Non-Sequential Processes", Gesellschaft fur Mathematik und Datenverarbeitung Bonn, Interner Bericht ISF-77-5, 1977.


Trace Semantics for Concurrent Objects - Vasconcelos (1992)   (Correct)

....after the appearance of Plotkin s method of Structured Operational Semantics [19] have been mostly developed with respect to Milner s Calculus of Communicating Processes [16] and other similar algebraic process languages. On the other hand, true concurrent models (including Petri nets [18], Winskel s event structures [17, 21] and Mazurkiewicz s traces [1] were primarily developed in relation to Petri nets. Meseguer s concurrent term rewriting logic [14] is another true concurrent model: it aims at describing a wide variety of concurrent systems. While there is some work done on ....

C. A. Petri. Non-sequential processes. GMD-ISF 77-S, Gesselschaft Math., Datenverarb. , St. Augustin, 1977.


An Axiomatization of the Category of Petri Net Computations - Sassone (1997)   (8 citations)  (Correct)

....net N, the strongly concatenable processes of N are isomorphic to the arrows of Q (N) In addition, we identify a coreflection right adjoint to Q ( and characterize its replete image, thus yielding an axiomatization of the category of net computations. Introduction Petri nets, introduced by C.A. Petri in (Petri 1962) see also Petri 1973; Reisig 1985) are unanimously considered one of the most representative models for concurrency, since they are a fairly simple and natural model of concurrent and distributed computations. However, Petri nets are, in our opinion, not yet completely ....

C.A. PETRI (1977), Non-Sequential Processes. Interner Bericht ISF--77--5, Gesellschaft fur Mathematik und Datenverarbeitung, Germany.


Models for Concurrency - Winskel, Nielsen (1994)   (123 citations)  (Correct)

....the coherence axiom (referred to as properness by Mazurkiewicz [62] in their definition. As remarked, Mazurkiewicz traces may be viewed as special kinds of labelled partial orders of events. Labelled partial orders of events appeared earlier in the study of concurrency by Lamport [46] and Petri [71], and has been advocated under the name of pomsets by Pratt in a series of papers beginning with [76] and by Grabowski under the name of partial words [30] Note that far from all pomsets can be seen as Mazurkiewicz traces. Consequently Mazurkiewicz trace languages correspond to special kinds of ....

....systems. Our version of Petri nets has been used as semantic model for process languages in the works of e.g. Olderog [68] There are several versions of morphisms on nets in the literature, some more deserving of attention than others. We have examined two. The original definition by Petri [71] seems to have been motivated by graph theoretic considerations Petri s morphisms do not respect the behaviour of nets. To some extent the ideas presented here generalise to nets in which events can fire and markings hold with multiplicities, as indicated in [99] though at present it is not ....

Petri, C.A., Non-sequential processes, GMD-ISF Report ISF-77-05, 1977.


On the Semantics of Place/Transition Petri Nets - Meseguer, Montanari, Sassone (1996)   (3 citations)  (Correct)

....in the literature; we briefly discuss some of them below. At the most basic operational level we have of course the token game . To account for computations involving many different transitions and for the causal connections between transition events, various notions of process have been proposed (Petri 1977; Goltz and Reisig 1983; Best and Devillers 1987) but process models do not provide a satisfactory semantic denotation for Research partially supported by ESPRIT Basic Research Action CEDISYS. The first and the third authors have been supported by the US Office of Naval Research Contracts ....

Petri, C.A. (1977) Non-Sequential Processes. Interner Bericht ISF--77--5, Gesellschaft fur Mathematik und Datenverarbeitung, Bonn, Germany.


Representation Theorems for Petri Nets - Meseguer, Montanari, Sassone   (3 citations)  (Correct)

....the authors both together and individually on the theme of representing the space of computations of Petri nets in its mathematical essence. Introduction Among the semantics proposed for Petri nets [10] see also [11, 13] a relevant role is played by the various notions of process, e.g. [12, 5, 1], whose merit is to provide a faithful account of computations involving many different transitions and of the causal connections between the events occurring in computations. Bare process models, however, fail to bring to the foreground the algebraic structure of the space of computations of a ....

C.A. PETRI (1977), Non Sequential Processes, Interner Bericht ISF--77--5, Gesellschaft fur Mathematik und Datenverarbeitung.


The Algebraic Structure of Petri Nets - Sassone (2000)   Self-citation (Petri)   (Correct)

No context found.

C.A. Petri (1977), Non-Sequential Processes. Interner Bericht ISF--77--5, Gesellschaft f ur Mathematik und Datenverarbeitung, Bonn. of Aarhus.


The Algebraic Structure of Petri Nets - Sassone (2000)   Self-citation (Petri)   (Correct)

No context found.

C.A. Petri (1977), Non-Sequential Processes. Interner Bericht ISF--77--5, Gesellschaft f ur Mathematik und Datenverarbeitung, Bonn.


A Categorical Semantics of Quantum Protocols - Samson Abramsky And (2004)   (Correct)

No context found.

C. A. Petri. Non-sequential processes. Technical Report ISF-77-5, GMD, St-Augustin, Germany, 1977.


The Early Search for Tractable Ways of Reasoning About Programs - Jones (2003)   (Correct)

No context found.

C. A. Petri. Non-sequential processes. Technical Report ISF-77-05, GMD, Bonn, 1977. Translation of ISF-76-6.


Probabilistic Timing Verification and Timing Analysis for.. - Escalante (1998)   (1 citation)  (Correct)

No context found.

C. A. Petri, "Non-sequential Processes", Internal Report GMD-ISF-77-5, Gesellschaft fr Informatik and Datenver-arbeitung, Bonn, Germany, 1977.


Formal Methods - Selected Historical References - Jones, McCauley (1992)   (1 citation)  (Correct)

No context found.

C. A. Petri. Non-sequential processes. Technical Report ISF-77-05, GMD, Bonn, 1977. Translation of ISF-76-6.


Prefix Function View of States and Events - Antoni Mazurkiewicz   (Correct)

No context found.

Petri, C.A. (1977) Non-Sequential Processes.GMD Report ISF-77-05.

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