Entry Goltz:1994:FPN from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Goltz:1994:FPN,
author = "Ursula Goltz and Arend Rensink",
title = "Finite {Petri} nets as models for recursive causal
behaviour",
journal = j-THEOR-COMP-SCI,
volume = "124",
number = "1",
pages = "169--179",
day = "14",
month = feb,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:53 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=124&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=124&issue=1&aid=1509",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
corpsource = "Gsellschaft fur Math. and Datenverarbeitung, St.
Augustin, Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "branching structure; calculus of communicating
systems; causal dependencies; failure equivalence;
finite Petri nets; interleaving behaviour; Petri nets;
pomset trace equivalence; recursive causal behaviour;
recursive CCS terms",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- behaviour,
71(2)193,
74(3)273,
76(1)115,
79(1)163,
88(2)269,
90(1)119,
92(2)249,
92(2)291,
96(1)3,
103(2)335,
119(1)39,
124(1)180,
125(2)167,
128(1)127,
129(2)279,
132(1)1
- branching,
74(3)313,
75(3)263,
89(1)161,
96(1)35,
96(1)z,
107(1)121,
110(1)99,
114(2)273
- causal,
79(1)179,
101(2)265,
112(1)5,
118(1)21
- CCS,
72(2)203,
72(2)z,
75(3)223,
80(2)263,
89(1)161,
96(1)217,
101(2)265,
113(2)231,
114(1)31,
114(1)119,
114(1)z,
128(1)159
- communicating,
72(2)203,
75(1)3,
75(3)223,
87(1)97,
98(2)249,
98(2)263,
107(2)357,
113(1)93,
113(2)231,
114(1)31,
114(1)119,
114(1)z,
123(2)183,
124(1)1,
127(1)123,
128(1)159,
134(2)365
- dependency,
74(2)121,
77(3)291,
81(1)117,
91(1)23,
92(2)249,
100(2)347,
107(2)169,
107(2)277,
123(1)31,
133(2)361,
133(2)387
- failure,
75(1)45,
75(1)z,
79(2)275,
80(2)263,
86(1)107,
101(2)239,
105(1)85,
120(1)1,
128(1)127,
128(1)179,
131(2)295
- interleaving,
75(3)263,
90(1)127,
96(2)285,
101(2)239,
114(1)63,
114(1)173,
124(1)1
- net,
71(1)133,
74(1)71,
74(2)199,
77(3)321,
80(1)1,
80(1)77,
80(2)263,
80(2)337,
82(2)341,
91(2)205,
91(2)285,
93(2)185,
95(1)159,
96(1)3,
96(1)175,
96(1)z,
96(2)285,
98(2)199,
99(1)79,
101(2)161,
102(1)165,
102(1)185,
103(1)51,
103(2)335,
104(2)207,
109(1)257,
113(2)231,
113(2)371,
114(1)93,
115(1)3,
122(1)165,
127(1)149,
131(2)331,
132(1)113,
134(1)51,
134(1)87,
135(1)111,
135(1)z,
135(2)361,
135(2)377,
182(1)257
- Petri,
71(1)133,
74(1)71,
74(2)199,
77(3)321,
80(1)1,
80(1)77,
80(2)263,
82(2)341,
91(2)205,
91(2)285,
93(2)185,
95(1)159,
96(1)3,
96(1)175,
96(1)z,
96(2)285,
98(2)199,
99(1)79,
101(2)161,
102(1)165,
102(1)185,
103(1)51,
103(2)335,
104(2)207,
109(1)257,
113(2)231,
114(1)93,
122(1)165,
127(1)149,
134(1)87,
135(2)361,
135(2)377
- pomset,
114(1)173,
135(2)171
- term,
72(2)133,
72(2)169,
72(2)225,
72(2)z,
73(2)177,
75(1)111,
75(1)157,
75(1)z,
76(2)261,
77(1)131,
78(2)267,
79(1)179,
80(1)1,
80(2)263,
80(2)303,
82(2)403,
83(1)3,
87(1)25,
90(2)369,
93(2)245,
94(1)1,
103(2)273,
105(2)217,
107(2)333,
109(1)7,
112(1)99,
114(2)273,
115(2)391,
118(2)167,
121(1)279,
124(2)297,
126(1)31,
131(1)29,
132(1)319,
134(2)311,
135(2)423,
136(2)333
- trace,
74(1)3,
76(2)331,
87(1)97,
91(2)285,
92(2)249,
97(2)301,
98(1)115,
101(2)337,
107(2)357,
108(1)25,
113(1)35,
118(2)263,
120(1)101,
125(2)167,
126(2)143,
132(1)179,
134(1)87