Embed Size (px)
Citation preview
Bibliography
[Abr87]
[AceS9]
[Ace90]
[AH89]
[AH91]
[And83]
[AR88]
[Bau88]
[Bau90]
[BC87]
[BD871
S. Abramsky: Observation equivalence as a testing equivalence. Theor. Comp. Sci. 53:225-241, 1987
L. Aceto: On relating concurrency and nondeterminism. Technical Report 6/89, Dept. Comp. Sci. Univ. of Sussex, Brighton, 1989
L. Aceto: Full abstractions for series-parallel pomsets. Technical Report 1/90, Dept. Comp. Sci. Univ. of Sussex, Brighton, 1990
L. Aceto, M. Hennessy: Towards action-refinement in process algebras. In: Proc. 4th LICS, 138-145. IEEE Computer Society Press, 1989. A full version has appeared as: Computer Science Report 3/88, Dept. Comp. Sci. Univ. of Sussex, Brighton, 1988
L. Aceto, M. Hennessy: Adding action refinement to a finite process alge- bra. In: J. Leach Albert, B. Monien, M. Rodr{guez Artalejo(eds.): ICALP 91, Lect. Notes Comp. Sci. 510, 506-519. Springer, 1991
C. Andre: The behaviour of a Petri net on a subset of transitions. R.A.I.R.O. 17:5-21, 1983
I.J. Aalbersberg, G. Rozenberg: Theory of traces. Theoret. Comput. Sci. 60:1-82, 1988
B. Baumgarten: On internal and external characterizations of PT-net building block behaviour. In: G. Rozenberg(ed.): Advances in Petri Nets 1988, Lect. Notes Comp. Sci. 340, 44-61. Springer, 1988
B. Baumgarten: Petri-Netze. Grundlagen und Anwendungen. BI-Wissen- schaftsverlag, 1990
G. Boudol, I. Castellani: On the semantics of concurrency: Partial orders and transition systems. In: H. Ehrig et al.(eds.): TAPSOFT 87, Vol. I, Lect. Notes Comp. Sci. 249, 123-137. Springer, 1987
E. Best, R. Devillers: Sequential and concurrent behaviour in Petri net theory. Theoret. Comput. Sci. 55:87-136, 1987
242 BIBLIOGRAPHY
[BDC92]
[BDKP91]
[Ber87]
[Bes88a]
[Bes88b]
[BF88]
[BHR84]
[BK84]
[BKO87]
[Bo190]
[BR84]
[BR88]
[Bra84]
[Bro83]
[Car86]
L. Bernardinello, F. De Cindio: A survey of basic net models and modular net classes. In: G. Rozenberg(ed.): Advances in Petri Nets, Lect. Notes Comp. Sci., Springer, 1992. Submitted
E. Best, R. Devillers, A. Kiehn, L. Pomello: Concurrent bisimulations in Petri nets. Acta Informatica 28:231-264, 1991
G. Berthelot: Transformations and decompositions of nets. In: W. Brauer et al.(eds.): Petri Nets: Central Models and Their Properties, Lect. Notes Comp. Sci. 254, 359-376. Springer, 1987
E. Best: Kausale Semantik nichtsequentieller Programme. Habilitation- sschrift, Rhein. Friedr.-Wilh.-Univ. Bonn, 1988. Also available as GMD- Bericht Nr. 174, Oldenbourg Verlag, 1989
E. Best: Weighted basic Petri nets. In: F.H. Vogt(ed.): Concurrency 88, Lect. Notes Comp. Sci. 335, 257-276. Springer, 1988
E. Best, C. Fernandez: Nonsequential Processes. A Petri Net View. EATCS Monographs on Theor. Comput. Sci. 13. Springer, 1988
S.D. Brookes, C.A.R. Hoare, A.W. Roscoe: A theory of communicating sequential processes. J. ACM 31:560-599, 1984
J.A. Bergstra, J.W. Klop: Process algebra for synchronous communica- tion. Information and Control 60:109-137, 1984
J.A. Bergstra, J.W. Klop, E.R. Olderog: Failures without chaos: A new process semantics for fair abstraction. In: M. Wirsing(ed.): Formal De- scription of Programming Concepts III, 77-103. North-Holland, 1987
B. Bollobks: Graph Theory. An Introductory Course. Graduate Texts in Mathematics 63. Springer, 1990
S.D. Brookes, A.W. Roscoe: An improved failures model for communicat- ing processes. In: S.D. Brookes, A.W. Roscoe, G. Winskel(eds.): Seminar on Concurrency, Lect. Notes Comp. Sci. 197, 281-305. Springer, 1984
A. Bourguet-Rouger: External behaviour equivalence between two Petri nets. In: F.H. Vogt(ed.): Concurrency 88, Lect. Notes Comp. Sci. 335, 237-256. Springer, 1988
W. Brauer: How to play the token game. Petri Net Newsletter 16:3-13, 1984
S.D. Brookes: A model for communicating sequential processes. Technical Report CMU-CS-83-149, Carnegie-Mellon-Univ., Pittsburgh, 1983
H. Carstensen: Fairne~ bei nebenl~ufigen Systemen. PhD thesis, Univ. Hamburg, 1986
BIBLIOGRAPHY 243
[CDMP87]
[Che91]
[Dar821
[DCDMPS88]
[DCDMS87]
[DD89]
[DDNM88]
[DDNM891
[Dev90a]
[Dev90b]
[Dev91]
[Die90]
L. Castellano, G. De Michelis, L. Pomello: Concurrency vs. interleaving: An instructive example. Bull. EATCS 31:12-15, 1987
G. Chehaibar: Replacement of open interface subnets and stable state transformation equivalence. In: Proc. 12th Int. Conf. Applications and Theory of Petri Nets, Gjern, 390-409, 1991
P. Darondeau: An enlarged definition and complete axiomatisation of observational congruence of finite processes. In: M. Dezani-Ciancaglini, U. Montanari(eds.): International Symposium on Programming, Lect. Notes Comp. Sci. 137, 47-62. Springer, 1982
F. De Cindio, G. De Michelis, L. Pomello, C. Simone: A state trans- formation equivalence for concurrent systems: Exhibited functionality- equivalence. In: F.H. Vogt(ed.): Concurrency 88, Lect. Notes Comp. Sci. 335, 222-236. Springer, 1988
F. De Cindio, G. De Michelis, C. Simone: GAMERU: A language for the analysis and design of human communication pragmatics within organiza- tional systems. In: G. Rozenberg(ed.): Advances in Petri Nets 1987, Lect. Notes Comp. Sci. 266, 21-44. Springer, 1987
P. Darondeau, P. Degano: Causal trees. In: G. Ausiello et al.(eds.): ICALP 89, Lect. Notes Comp. Sci. 372, 234-248. Springer, 1989
P. Degano, R. De Nicola, U. Montanari: A distributed operational se- mantics for CCS based on condition/event systems. Acta Informatica 26:59-91, 1988
P. Degano, R. De Nicola, U. Montanari: Partial orderings descriptions and observations of nondeterministic concurrent processes. In: J.W. de Bakker et al.(eds.): Proc. REX School / Workshop Linear Time, Branching Time and Partial Order in Logic and Models of Concurrency. Noordwijkerhout, 1988, Lect. Notes Comp. Sci. 354, 438-466. Springer, 1989
R. Devillers: The semantics of capacities in P/T-nets. In: G. Rozen- berg(ed.): Advances in Petri Nets 1989, Lect. Notes Comp. Sci. 424, 128- 150. Springer, 1990
R. Devillers: Maximality preserving bisimulation. Technical Report LIT- 214, Univ. Bruxelles, 1990. To appear in Theoret. Comput. Sci.
R. Devillers: Maximality preservation and the ST-idea for action refine- ment. Technical Report LIT-242, Univ. Bruxelles, 1991
V. Diekert: Combinatorics on Traces. Lect. Notes Comp. Sci. 454. Springer, 1990
244 BIBLIOGRAPHY
[Dij71]
[DM87]
[DNH84]
[DV89]
[EngS5]
[Eng90]
[Fis70]
[Gen87]
[CCS9a]
[CC89b]
[CC90]
[GL91]
[Gla90a]
[Gla90b]
E.W. Dijkstra: Hierarchical ordering of sequential processes. Acta Infor- matica 1:115-138, 1971
P. Degano, U. Montanari: Concurrent histories: A basis for observing distributed systems. J. Comp. Sys. Sci. 34:422-461, 1987
R. De Nicola, M.C.B. Hennessy: Testing equivalence for processes. The- oret. Comput. Sci. 34:83-133, 1984
V. Diekert, W. Vogler: On the synchronization of traces. Math. Systems Theory 22:161-175, 1989
J. Engelfriet: Determinacy --~ (observation equivalence = trace equiva- lence). Theoret. Comput. Sci. 36:21-25, 1985
U. Engberg: Partial Orders and Fully Abstract Models for Concurrency. PhD thesis, Computer Science Dept. Aarhus Univ., 1990. Technical Report DAIMI PB-307
P.C. Fishburn: Intransitive indifference with unequal indifference intervals. J. Math. Psych. 7:144-149, 1970
H. J. Genrich: Predicate/transition nets. In: W. Brauer et al.(eds.): Petri Nets: Central Models and Their Properties, Lect. Notes Comp. Sci. 254, 207-247. Springer, 1987
R.J .v . Glabbeek, U. Goltz: Partial order semantics for refinement of actions - neither necessary nor always sufficient, but appropriate when used with care. EATCS Bulletin 38:154-163, 1989
R.J.v. Glabbeek, U. Goltz: Equivalence notions for concurrent systems and refinement of actions. In: A. Kreczmar, G. Mirkowska(eds.): MFCS 89, Lect. Notes Comp. Sci. 379, 237-248. Springer, 1989
R.J .v . Glabbeek, U. Goltz: Refinement of actions in causality based models. In: J.W. de Bakker, W.P. de Roever, G. Rozenberg(eds.): Proc. REX Workshop on Stepwise Refinement of Distrib. Systems 1989, Lect. Notes Comp. Sci. 430,267-300. Springer, 1990
R. Gorrieri, C. Laneve: The limit of split~-bisimulations for CCS agents. In: A. Tarlecki(ed.): MFCS 91, Lect. Notes Comp. Sci. 520, 170-180. Springer, 1991
R.J.v. Glabbeek: private communication, 1990
R.J.v. Glabbeek: Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Univ. Amsterdam, 1990
BIBLIOGRAPHY 245
[Gla90~
[GMM88]
[ao187]
[Go188a]
[GolSSb]
[Gra81]
[GV87]
[GV90]
[GV91]
[GWS9a]
[GWS9b]
[Hac76~
[Hac76b]
R.J.v. Glabbeek: The refinement theorem for ST-bisimulation semantics. In: M. Broy, C.B. Jones(eds.): Proc. IFIP Working Conference on Pro- gramming Concepts and Methods, Sea of Galilee, Israel, 1990. To appear
R. Gorrieri, S. Marchetti, U. Montanari: A2CCS: A simple extension of CCS for handling atomic actions. In: M. Dauchet, M. Nivat(eds.): CAAP '88, Lect. Notes Comp. Sci. 299, 258-270. Springer, 1988
U. Goltz: 0ber die Daxstellung von CCS-Programmen durch Petrinetze. Dissertation, RWTH Aachen, 1987. Also available as GMD-Bericht Nr. 172, Oldenbourg Verlag 1988
R. Gold: Verklemmungsfreiheit bei modularer Konstruktion fairer Petri- netze. Diplomarbeit, Techn. Univ. Mfinchen, 1988
U. Goltz: On representing CCS programs by finite Petri nets. In: M.P. Chytil et al.(eds.): Proc. MFCS 1988, Lect. Notes Comp. Sci. 324,339-350. Springer, 1988
J. Grabowski: On partial languages. Fundamenta Informaticae IV.2:428- 498, 1981
R.J.v. Glabbeek, F. Vaandrager: Petri net models for algebraic theories of concurrency. In: J.W. de Bakker et al.(eds.): PARLE Vol. II, Lect. Notes Comp. Sci. 259,224-242. Springer, 1987
R. Gold, W. Vogler: Quality criteria for partial order semantics of place/transition nets. In: B. Rovan(ed.): MFCS 90, Lect. Notes Comp. Sci. 452, 306-312. Springer, 1990
R.J .v . Glabbeek, F. Vaandrager: The difference in splitting into n and n+l . 1991. Unpublished
R.J.v. Glabbeek, W.P. Weijland: Refinement in branching time semantics. In: Proc. AMAST Conf., 197-201, 1989
R.J .v . Glabbeek, W.P. Weijland: Branching time and abstraction in bisimulation semantics. In: G.X. Ritter(ed.): Information Processing 89, 613-618. North-Holland, 1989
M. H. T. Hack: The equality problem for vector addition systems is unde- cidable. Theoret. Comput. Sci. 2:77-95, 1976
M. H. T. Hack: Petri net languages. Technical Report TR-159, MIT, Boston, 1976
[Hoa85] C.A.R. Hoare: Communicating Sequential Processes. Prentice-Hall, 1985
246 BIBLIOGRAPHY
[HRT89]
[Jen87]
[JK90]
[JM91]
[Kie88]
[Kos82]
[KS90]
[Lam86]
[May81]
[Maz84]
[Maz87]
[Maz88]
[Mi177]
J. Hirshfeld, A. Rabinovich, B.A. Trakhtenbrot: Discerning causality in interleaving behaviour. In: A.R. Meyer, M.A. Taitslin(eds.): Logic at Botik '89, Lect. Notes Comp. Sci. 363, 146-162. Springer, 1989
K. Jensen: Coloured Petri nets. In: W. Brauer et al.(eds.): Petri Nets: Central Models and Their Properties, Lect. Notes Comp. Sci. 254, 248-299. Springer, 1987
R. Janicki, M. Koutny: Observing concurrent histories. In: H.M.S. Zedan(ed.): Real-Time Systems, Theory and Applications, 133-142. North-Holland, 1990
L.A. Jategaonkar, A.R. Meyer: Testing equivalence for Petri nets with action refinement. Unpublished Manuscript, 1991
A. Kiehn: On the interrelationship between synchronized and non-syn- chronized behaviour of Petri nets. J. Inf. Process. Cybern. EIK 24:3-18, 1988
S.R. Kosaraju: Decidability of reachability in vector addition systems. In: Proc.14th Annual ACM Symposium on Theory of Computing, San Francisco, 267-281, 1982
P.C. Kanellakis, S.A. Smolka: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation 86:43-68, 1990
L. Lamport: On interprocess communication I. Distributed Comp. 1:77- 85, 1986
E.W. Mayr: An algorithm for the general Petri net reachability problem. In: Proc 13th Annual ACM Symposium on Theory of Computing, 238- 246, 1981
A. Mazurkiewicz: Traces, histories, graphs: Instances of a process monoid. In: M.P. Chytil et al.(eds.): Proceeding of the l l t h Symposium on Math- ematical Foundations of Computer Science (MFCS), Lect. Notes Comp. Sci. 176, 115-133. Springer, 1984
A. Mazurkiewicz: Trace theory. In: W. Brauer et al.(eds.): Petri Nets: Ap- plications and Relationships to other Models of Concurrency, Lect. Notes Comp. Sci. 255,279-324. Springer, 1987
A. Mazurkiewicz: Compositional semantics of pure place/transition sys- tems. Fundamenta Informaticae XI:331-356, 1988
R. Milner: Fully abstract models of typed A-calculi. Theor. Comput. Sci. 4:1-22, 1977
BIBLIOGRAPHY 247
[Mil80]
[MilS1]
[Mi1831
[MilS9]
[Mill85]
[Mur90]
[NEL89]
[NPWS1]
[OH861
[01d89]
[Par81]
[Pe1871
[Pet81]
[Plo81]
[Pom86]
R. Milner: A Calculus for Communicating Systems. Lect. Notes Comp. Sci. 92. Springer, 1980
R. Milner: A modal characterisation of observable machine-behaviour. In: G. Astesiano, C. Bghm(eds.): CAAP 81, Lect. Notes Comp. Sci. 112, 267-310. Springer, 1981
R. Milner: Calculi for synchrony and asynchrony. Theor. Comput. Sci. 25:267-310, 1983
R. Milner: Communication and Concurrency. Prentice Hall, 1989
K. Miiller: Constructable Petri nets. Elektr. Inf. Kybern. 21:171-199, 1985
D.V.J.. Murphy: Time, Causality and Concurrency. PhD thesis, Univ. of Surrey, 1990
M. Nielsen, U. Engberg, K. Larsen: Partial order semantics for concur- rency. In: J.W. de Bakker et al.(eds.): Proc. REX School / Workshop Linear Time, Branching Time and Partial Order in Logic and Models of Concurrency. Noordwijkerhout, 1988, Lect. Notes Comp. Sci. 354, 523-548. Springer, 1989
M. Nielsen, G.D. Plotkin, G. Winskeh Petri nets, event structures and domains I. Theor. Comput. Sci. 13:85-108, 1981
E.R. Olderog, C.A.R. Hoare: Specification-oriented semantics for commu- nicating processes. Acta Informatica 23:9-66, 1986
E.R. Olderog: Nets, terms and formulas: Three views of concurrent pro- cesses and their relationship. Habilitationsschriff, Univ. Kiel, 1989
D. Park: Concurrency and automata on infinite sequences. In: P. Deussen(ed.): Proc. 5th GI Conf. on Theoretical Comp. Sci., Lect. Notes Comp. Sci. 104, 167-183. Springer, 1981
E. Pelz: Closure properties of deterministic Petri nets. In: F.J. Bran- denburg(ed.): STACS 87, Lect. Notes Comp. Sci. 247, 371-382. Springer, 1987
J.L. Peterson: Petri Net Theory. Prentice-Hall, 1981
G. Plotkin: A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus Univ., 1981
L. Pomello: Some equivalence notions for concurrent systems - an overview. In: G. Rozenberg(ed.): Advances in Petri Nets 1985, Lect. Notes Comp. Sci. 222,381-400. Springer, 1986
248 BIBLIOGRAPHY
[PomS8]
[Pra86]
[PS90I
[PS92]
[PT87]
[RB81]
[Rei85]
[ReiS8]
[Rei90]
[RT88]
[SM83]
[Sou91]
[sta81]
[Tau89]
[TV89]
[Va179]
L. Pomello: Osservatore, Reti di Petri, Processi. PhD thesis, Univ. of Milano and Torino, 1988
V. Pratt: Modelling concurrency with partial orders. Int. J. Parallel Prog. 15:33-71, 1986
L. Pomello, C. Simone: Preorders of concurrent systems. Internal report, DSI, Milano, 1990
L. Pomello, C. Simone: A survey of equivalence notions for net based systems. In: G. Rozenberg(ed.): Advances in Petri Nets, Lect. Notes Comp. Sci., 1992. Submitted
R. Paige, R. Tarjan: Three partition refinement algorithms. SIAM J. Computing 16:973-989, 1987
W.C. Rounds, S.D. Brookes: Possible futures, acceptances, refusals and communicating processes. In: Proc. 22nd Ann. Symp. on Foundations of Comp. Sci., 140-149. IEEE, 1981
W. Reisig: Petri Nets. EATCS Monographs on Theoretical Computer Science 4. Springer, 1985
W. Reisig: Concurrency is more fundamental than interleaving. EATCS Bulletin 3:181-185, 1988
W. Reisig: Petri nets and algebraic specification. Technical Report SFB- Bericht Nr. 342/1/90B, Inst. Informatik, Techn. Univ. Miinchen, 1990
A. Rabinovich, B.A. Trakhtenbrot: Behaviour structures and nets. Fun- damenta Informaticae 11:357-404, 1988
I. Suzuki, T. Murata: A method for stepwise refinement and abstraction of Petri nets. J. Comp. Sys. Sci. 27:51-76, 1983
Y. Souissi: On liveness preservation by composition of nets via a set of places. In: G. Rozenberg(ed.): Advances in Petri Nets 1991, Lect. Notes Comp. Sci. 524, 277-295. Springer, 1991
P.H. Starke: Processes in Petri nets. J. Inf. Process. Cybern. EIK 17:389- 416, 1981
D. Taubner: Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. Lect. Notes Comp. Sci. 369. Springer, 1989
D. Taubner, W. Vogler: Step failures semantics and a complete proof system. Acta Informatica 27:125-156, 1989
R. Valette: Analysis of Petri nets by stepwise refinement. J. Comp. Sys. Sci. 18:35-46, 1979
BIBLIOGRAPHY 249
[vJ851 R. Valk, M. Jantzen: The residue of vector sets with application to decid- ability problems in Petri nets. Acta Informatica 21:643-674, 1985
[VN821 G. Vidal-Naquet: Deterministic languages for Petri nets. In: C. Gi- rault, W. Reisig(eds.): Application and Theory of Petri Nets, Informatik- Fachber. 52, 198-202. Springer, 1982
[Vog87] W. Vogler: Behaviour preserving refinements of Petri nets. In: G. Tin- borer, G. Schmidt(eds.): Graph-Theoretic Concepts in Computer Science, Proc. WG 86, Bernried, Lect. Notes Comp. Sci. 246, 82-93. Springer, 1987
[Vog89] W. Vogler: Failures semantics and deadlocking of modular Petri nets. Acta Informatica 26:333-348, 1989
[Vog90] W. Vogler: Representation of a swapping class by one net. In: G. Rozen- berg(ed.): Advances in Petri Nets 1989, Lect. Notes Comp. Sci. 424,467- 486. Springer, 1990
[Vog91a] W. Vogler: Executions: A new partial order semantics of Petri nets. Theoret. Comput. Sci. 91:205-238, 1991
[Vog91b] W. Vogler: Failures semantics based on interval semiwords is a congruence for refinement. Distributed Computing 4:139-162, 1991
[Vog91c] W. Vogler: Bisimulation and action refinement. In: C. Choffrut, M. Jantzen(eds.): STACS 91, Lect. Notes Comp. Sci. 480, 309-321. Springer, 1991
[Vog91d] W. Vogler: Deciding history preserving bisimilarity. In: J. Leach Albert, B. Monien, M. Rodr~guez Artalejo(eds.): ICALP 91, Lect. Notes Comp. Sci. 510, 495-505. Springer, 1991
[Vos87] K. Voss: Interface as a basic concept for systems specification and verifi- cation. In: K. Voss(ed.): Concurrency and Nets, 585-604. Springer, 1987
I n d e x
ac t ion 9 part 160 refinement 137, 188
admissible 218 alphabet 10,220 arc weight 10 atomic 219 autoconcurrent 13
bis imilar d ivergence 30 bisimulation 28
branching 30 history-preserving 191,209 interleaving 28, 190, 191 O M 212 partial-word 190, 191 pomset 190, 191 S T 197 step 190, 191
bounded 13 1-bounded 218
capac i ty 218 actual 225 -modification 226 -oriented 226
causal net 17 choice 72 co 16 complementation 226
-invariant 226 complete 151,159, 161 compositional w.r.t, an operator 219,221 concurrent 11, 16 configuration 187 conflict 13, 186,187 consistent 219 contact-free 225
current 147 cut 16
dead 13 deadlock 43 deterministic 81 divergence string 27 diverging
interval word 162 net 43
downward-closed 16, 187
enabled image- 12 interval sequence 147 partial word 20
image- 20 step,transition 11
with capacity 218 step,transition sequence 11 transition part 147 under ordered marking 210, 211
enabling-finite 14 end transition 137 env 96 event structure 186
of a process 19 externally
marking-equivalent 58 mc-equivalent 67
2- 26 2--deterministic 81
2-+ 60 2 -++ 60 failure/divergence semantics 27 failure semantics 26 fa i r -equiva len t 69
INDEX 251
9vT~ 27 .T:D-deterministic 81
~'~D/A 56 firing sequence 11
image 12 underlying 12
firing step sequence 11 image 12 underlying 12
Flow 222 flow-reduction 228 flowseq-closed 228 flow-sequentialization 228 FS 11 FSS 11
56 fully abstract 42
hiding 70 homomorphism 187
image-f ini te 14, 204 image-live 13
-equivalent 59 implementation 44 initOM 210 mjective for 14 mjectively labelled 14 input-transition 219 internal 9 interval order 156 interval representation 172, 174 interval semiword 156 interval sequence 147
action 160 indexed 180
interval word 147 failure/divergence semantics 162 failure semantics 162 image 161
non-empty 161 of a refinement net 161
of a refinement net 159 invariantly reachable 59 IO.T 113
I, O-net 110 /R-equivalent 59 iwY: 162 iw Y::D 162
L 12 labelling 10, 186 label-preserving 16, 187 language 12 Lin 18 linearization 16, 18 live 13 loop 13
M 11 marking 11
-equivalent 12 externally 58
follower 11 initial 10 ordered 210 reachable 12 ST-marking 129
mc-equivalent 65 externally 67
mr-equivalent 65 A~ 9Vp~D-semantics 101
net 10 Nh-host 122
safe 124 Nh-A-host 80 Nh-module 119
safe 124 non-absorbing 110 Np-host 79
safe 90 Nv-module 85
safe 90
o c c u r
step,transition ii step,transition sequence ii under an ordered marking 210
OM-bisimulation 185 order-preserving 16
252 INDEX
output-bounded 110 output-deterministic 110 output-transition 219
~r0 17 parallel composition 34, 39 partial order 15 partial word 20
image 20 underlying 20
P-daughter-net 80 P-deadlock-equivalent 94 P-divergence-free 110 P~'-semantics 96 P-host 80 place 10
composition 80 refinement 79
postset 10 pr~ 35 prefix 16
-closed 219 pre-order 16 preset 10 Proc 18, 222 process 17
action structure 18 event structure 18 initial 17 of a refinement net 151
P W 20, 220 P W A 222
reachabi l i ty graph 13 reachable
invariantly 59 marking 12 ordered marking 210 ST-marking 129
ready set 161 refinement function 137
action structure 154 event structure 154 image interval word 163 process 151
semiword 154 image 154
refinement net 137 Nh-refinement net 80 Np-refinement net 79
refusal set 26 relabelling 70
safe 13 deadlock-equivalent 56
self-concurrent 13 semiword 24
of a refinement net 151 sequential 13
less 16, 188 SL 12 S-modification 235
invariant 236 splitting 135, 170 start transition 124, 137 ST-bisimulation 172 ST-configuration 195 step 11,188
language 12 Step 18 ST-marking 147
reachable 147 structurally redundant 235 S W 24 synchronization 221
t e r m i n a t e d 147, 160 termination set 176 token 10 transition 10
part 147 refinement 80
T-restricted 12 trunk 176
un i fo rm 230 upward-closed 16
visible 9, 166
wel l -behaved 232
Lecture Notes in Computer Science For information about Vols. 1-535 please contact your bookseller or Springer-Verlag
Vol. 536: J. E. Tomayko, Software Engineering Education. Pro- ceedings, 1991. VIII, 296 pages. 1991.
Vol. 537: A. J. Menezes, S. A. Vanstone (Eds.), Advances in Cryptology -CRYPTO '90. Proceedings. XII1, 644 pages. 199 I.
Vol. 538: M. Kojima, N. Megiddo, T. Noma, A. Yoshise, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. VIII, 108 pages. 1991.
Vol. 539: H. F. Mattson, T. Mora, T. R. N. Rao (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Proceedings, 1991. XI, 489 pages. 1991.
Vol. 540: A. Prieto (Ed.), Artificial Neural Networks. Proceed- ings, 1991. XIII, 476 pages. 1991.
Vol. 541 : P. Barahona, L. Moniz Pereira, A. Porto (Eds.), EPIA '91. Proceedings, 1991. VIII, 292 pages. 1991. (Subseries LNAI).
Vol. 542: Z. W. Ras, M. Zemankova (Eds.), Methodologies for Intelligent Systems. Proceedings, 1991. X, 644 pages. 1991. (Subseries LNAI).
Vol. 543: J. Dix, K. P. Jantke, P. H. Schmitt (Eds.), Non- monotonic and Inductive Logic. Proceedings, 1990. X, 243 pages. 199 I. (Subseries LNAI).
Vol. 544: M. Broy, M. Wirsing (Eds.), Methods of Program- ming. XII, 268 pages. 1991.
Vol. 545: H. Alblas, B. Melichar (Eds.), Attribute Grammars, Applications and Systems. Proceedings, 1991. IX, 513 pages. 1991.
Vol. 546: O. Herzog, C.-R. Rollinger (Eds.), Text Understand- ing in LILOG. XI, 738 pages. 1991. (Subseries LNAI).
Vol. 547: D. W. Davies (Ed.), Advances in Cryptology - EUROCRYPT '91. Proceedings, 1991. Xll, 556 pages. 1991.
Vol. 548: R. Kruse, P. Siegel (Eds.), Symbolic and Quantitative Approaches to Uncertainty. Proceedings, 1991. XI, 362 pages. 1991.
Vol. 549: E. Ardizzone, S. Gaglio, F. Sorbello (Eds.), Trends in Artificial Intelligence. Proceedings, 199 I. XIV, 479 pages. 199 I. (Subseries LNAI).
Vol. 550: A. van Lamsweerde, A. Fugetta (Eds.), ESEC '91. Proceedings, 1991. XII, 515 pages. 1991.
Vol. 551:S. Prehn, W. J. Toetenel (Eds.), VDM '91. Formal Software Development Methods. Volume I. Proceedings, 199 I. XIII, 699 pages. 1991.
Vol. 552: S. Prehn, W. J. Toetenel (Eds.), VDM '91. Formal Software Development Methods. Volume 2. Proceedings, 199 I. XIV, 430 pages. 1991.
Vol. 553: H. Bieri, H. Noltemeier (Eds.), Computational Ge- ometry - Methods, Algorithms and Applications '91. Proceed- ings, 1991. Viii, 320 pages. 1991.
Vol. 554: G. Grahne, The Problem of Incomplete Information in Relational Databases. VIII, 156 pages. 1991.
Vol. 555: H. Maurer (Ed.), New Results and New Trends in Computer Science. Proceedings, 199 I. VIII, 403 pages. 199 I.
Vol. 556: J.-M. Jacquet, Conclog: A Methodological Approach to Concurrent Logic Programming. XI1,781 pages. 199 I.
Vol. 557: W. L. Hsu, R. C. T. Lee (Eds.), ISA '91 Algorithms. Proceedings, 1991. X, 396 pages. 1991.
Vol. 558: J. Hooman, Specification and Compositional Verifi- cation of Real-Time Systems. VIII, 235 pages. 1991.
Vol. 559: G. Butler, Fundamental Algorithms for Permutation Groups. Xll, 238 pages. 1991.
Vol. 560: S. Biswas, K. V. Nori (Eds.), Foundations of Soft- ware Technology and Theoretical Computer Science. Proceed- ings, 1991. X, 420 pages. 1991.
Vol. 561: C. Ding, G. Xiao, W. Shan, The Stability Theory of Stream Ciphers. IX, 187 pages. 1991.
Vol. 562: R. Breu, Algebraic Specification Techniques in Ob- ject Oriented Programming Environments. XI, 228 pages. 1991.
Vol. 563: A. Karshmer, J. Nehmer (Eds.), Operating Systems of the 90s and Beyond. Proceedings, 1991. X, 285 pages. 1991.
Vol. 564: I. Herman, The Use of Projective Geometry in Com- puter Graphics. VIII, 146 pages. 1992.
Vol. 565: J. D. Becket, I. Eisele, F. W. Miindemann (Eds.), Par- allelism, Learning, Evolution. Proceedings, 1989. VIII, 525 pages. 1991. (Subseries LNAI).
Vol. 566: C. Delobel, M. Kifer, Y. Masunaga (Eds.), Deductive and Object-Oriented Databases. Proceedings, 1991. XV, 581 pages. 1991.
Vol. 567: H. Boley, M. M. Richter (Eds.), Processing Declara- tive Kowledge. Proceedings, 1991. XII, 427 pages. 1991. (Subseries LNAI).
Vol. 568: H.-J. Btirckert, A Resolution Principle for a Logic with Restricted Quantifiers. X, 116 pages. 1991. (Subseries LNAI).
Vol. 569: A. Beaumont, G. Gupta (Eds.), Parallel Execution of Logic Programs. Proceedings, 1991. VII, 195 pages. 1991.
Vol. 570: R. Berghammer, G. Schmidt (Eds.), Graph-Theoretic Concepts in Computer Science. Proceedings, 1991. VIII, 253 pages. 1992.
Vol. 571: J. Vytopil (Ed.), Formal Techniques in Real-Time and Fault-Tolerant Systems. Proceedings, 1992. IX, 620 pages. 1991.
Vol. 572: K. U. Schulz (Ed.), Word Equations and Related Top- ics. Proceedings, 1990. VII, 256 pages. 1992.
Vol. 573: G. Cohen, S. N. Litsyn, A. Lobstein, G. Z6mor (Eds.), Algebraic Coding. Proceedings, 1991. X, 158 pages. 1992.
Vol. 574: J. P. Ban~.tre, D. Le M6tayer (Eds.), Research Direc- tions in High-Level Parallel Programming Languages, Proceed- ings, 1991, VIII, 387 pages. 1992.
Vol. 575: K. G. Larsen, A. Skou (Eds.), Computer Aided Veri- fication. Proceedings, 1991. X, 487 pages. 1992.
Vol. 576: J. Feigenbaum (Ed.), Advances in Cryptology - CRYPTO '91. Proceedings. X, 485 pages. 1992.
Vol. 577: A. Finkel, M. Jantzen (Eds.L STACS 92. Proceed- ings, 1992. XIV, 62 [ pages. 1992.
Vol. 578: Th. Beth, M. Frisch, G. J. Simmons (Eds.L Public- Key Cryptography: State of the Art and Future Directions. XI, 97 pages. 1992.
Vol. 579: S. Toueg, P. G. Spirakis, L. Kirousis (Eds.), Distrib- uted Algorithms. Proceedings, 1991. X, 319 pages. 1992.
Vol. 580: A. Pirotte, C. Delobel, G. Gottlob (Eds.), Advances in Database Technology - EDBT '92. Proceedings. XII, 551 pages. 1992.
Vol. 581: J.-C. Raoult (Ed.), CAAP '92. Proceedings. VIII, 361 pages. 1992.
Vol. 582: B. Krieg-Briickner (Ed.), ESOP '92. Proceedings. VIII, 491 pages. 1992.
Vol. 583: I. Simon (Ed.), LATIN '92. Proceedings. IX, 545 pages. 1992.
Vol. 584: R. E. Zippel (Ed.), Computer Algebra and Parallel- ism. Proceedings, 1990. IX, 114 pages. 1992.
Vol. 585: F. Pichler, R. Moreno Diaz (Eds.), Computer Aided System Theory - EUROCAST '91. Proceedings. X, 761 pages. 1992.
Vol. 586: A. Cheese, Parallel Execution of Parlog. IX, 184 pages. 1992.
Vol. 587: R. Dale, E. Hovy, D. ROsner, O. Stock (Eds.), As- pects of Automated Natural Language Generation. Proceedings, 1992. VIII, 311 pages. 1992. (Subseries LNAI).
Vol. 588: G. Sandini (Ed.), Computer Vision - ECCV '92. Pro- ceedings. XV, 909 pages. 1992.
Vol. 589: U. Banerjee, D. Gelernter, A. Nicolau, D. Padua (Eds.), Languages and Compilers for Parallel Computing. Proceedings, 1991. IX, 419 pages. 1992.
Vol. 590: B. Fronh6fer, G. Wrightson (Eds.), Parallelization in Inference Systems. Proceedings, 1990. VIII, 372 pages. 1992. (Subseries LNAI).
Vol. 591: H. P. Zima (Ed.), Parallel Computation. Proceedings, 1991. IX, 451 pages. 1992.
Vol. 592: A. Voronkov (Ed.), Logic Programming. Proceed- ings, 1991. IX, 514 pages. 1992. (Subseries LNAI).
Vol. 593: P. Loucopoulos (Ed.), Advanced Information Sys- tems Engineering. Proceedings. XI, 650 pages. 1992.
Vol. 594: B. Monien, Th. Ottmann (Eds.), Data Structures and Efficient Algorithms. VIII, 389 pages. 1992.
Vol. 595: M. Levene, The Nested Universal Relation Database Model. X, 177 pages. 1992.
Vol. 596: L.-H. Eriksson, L. Halln,~is, P. Sehroeder-Heister (Eds.), Extensions of Logic Programming. Proceedings, 1991. VII, 369 pages. 1992. (Subseries LNAI).
Vol. 597: H. W. Guesgen, J. Hertzberg, A Perspective of Con- straint-Based Reasoning. VIl[, 123 pages. 1992. (Subseries LNAI).
Vol. 598: S. Brookes, M. Main, A. Melton, M. Mislove, D. Schmidt (Eds.), Mathematical Foundations of Programming Semantics. Proceedings, 199 I. VIII, 506 pages. 1992.
Vol. 599: Th. Wetter, K.-D. AIthoff, L Boose, B. R. Gaines, M. Linster, F. Schmalhofer (Eds.), Current Developments in Knowledge Acquisition - EKAW '92. Proceedings. XIII, 444 pages. 1992. (Subseries LNAI).
Vol. 600: J. W. de Bakker, C. Huizing, W. P. de Roever, G. Rozenberg (Eds.), Real-Time: Theory in Practice. Proceedings, 1991. VIll, 723 pages. 1992.
Vol. 601: D. Dolev, Z. Galil, M. Rodeh (Eds.), Theory of Com- puting and Systems. Proceedings, 1992. VIII, 220 pages. 1992.
Vol. 602: I. Tomek (Ed.), Computer Assisted Learning. Pro- ceedings, 1992. X, 615 pages. 1992.
Vol. 603: J. van Katwijk (Ed.), Ada: Moving Towards 2000. Proceedings, 1992. VIII, 324 pages. 1992.
Vol. 604: F. Belli, F.-J. Radermacher (Eds.), Industrial and Engineering Applications of Artificial Intelligence and Expert Systems. Proceedings, 1992. XV, 702 pages. 1992. (Subseries LNA1).
Vol. 605: D. Etiemble, J.-C. Syre (Eds.), PARLE '92. Parallel Architectures and Languages Europe. Proceedings, 1992. XVII, 984 pages. 1992.
Vol. 606: D. E. Knuth, Axioms and Hulls. IX, 109 pages. 1992.
Vol. 607: D. Kapur (Ed.), Automated Deduction - CADE-I I. Proceedings, 1992. XV, 793 pages. 1992. (Subseries LNAI).
Vol. 608: C. Frasson, G. Gauthier, G. I. McCalla (Eds.), Intelli- gent Tutoring Systems. Proceedings, 1992. XIV. 686 pages. 1992.
Vol. 609: G. Rozenberg (Ed.), Advances in Petri Nets 1992. VIII, 472 pages. 1992.
Vol. 610: F. yon Martial, Coordinating Plans of Autonomous Agents. XII, 246 pages. 1992. (Subseries LNAI).
Vol. 61 I: M. P. Papazoglou, J. Zeleznikow (Eds.), The Next Generation of Information Systems: From Data to Knowledge. VIII, 310 pages. 1992. (Suhseries LNAI).
Vol. 612: M. Tokoro, O. Nierstrasz, P. Wegner (Eds.), Object- Based Concurrent Computing. Proceedings, 199 I. X, 265 pages. 1992.
Vol. 613: J. P. Myers, Jr., M. J. O' Donnell (Eds.), Constructivity in Computer Science. Proceedings, 1991. X, 247 pages. 1992.
Vol. 614: R. G. Herrtwich (Ed.), Network and Operating Sys- tem Support for Digital Audio and Video. Proceedings, 1991. XII, 403 pages. 1992.
Vol. 615: O. Lehrmann Madsen (Ed.), ECOOP '92. European Conference on Object Oriented Programming. Proceedings. X, 426 pages. 1992.
Vol. 616: K. Jensen (Ed.), Application and Theory of Petri Nets 1992. Proceedings, 1992. VIII, 398 pages. 1992.
Vol. 617: V. Mal~lk, O. ~t6p~inkov~i, R. Trappl (Eds.), Advanced Topics in Artificial Intelligence. Proceedings, 199Z IX, 484 pages. 1992. (Subseries LNAI).
Vol. 618: P. M. D. Gray, R. J. Lucas (Eds.), Advanced Database Systems. Proceedings, 1992. X, 260 pages. 1992.
Vol. 619: D. Pearce, H. Wansing (Eds.), Nonclassical Logics and Information Proceedings. Proceedings, 1990. Vll, 171 pages. 1992. (Subseries LN AI ).
Vol. 620: A. Nerode, M. Taitslin (Eds.), Logical Foundations of Computer Science - Tver '92. Proceedings. IX, 514 pages. 1992.
Vol. 621: O. Nurmi, E. Ukkonen (Eds.), Algorithm Theory - SWAT '92. Proceedings. VIII, 434 pages. 1992.
Vol. 623: W. Kuich (Ed.), Automata, Languages and Program- ming. Proceedings, 1992. XIi, 721 pages. 1992.
Vol. 624: A. Voronkov (Ed.), Logic Programming and Auto- mated Reasoning. Proceedings, 1992. XIV, 509 pages. 1992. (Suhseries LNAI).
Vol. 625: W. Vogler, Modular Construction and Partial Order Semantics of Petri Nets. IX, 252 pages. 1992.
Vol. 626: E. B6rger, G. Jiiger, H. Kleine Bilning, M. M. Richter (Eds.), Computer Science Logic. Proceedings, 1991. VIII, 428 pages. 1992.
