---
_id: '3262'
author:
- first_name: Ursula
  full_name: Goltz, Ursula
  last_name: Goltz
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Goltz U, Wehrheim H. Causal Testing. In: Penczek W, Szalas A, eds. <i>Mathematical
    Foundations of Computer Science 1996, 21st International Symposium, MFCS’96, Cracow,
    Poland, September 2-6, 1996, Proceedings</i>. Lecture Notes in Computer Science.
    ; 1996:394--406. doi:<a href="https://doi.org/10.1007/3-540-61550-4_165">10.1007/3-540-61550-4_165</a>'
  apa: Goltz, U., &#38; Wehrheim, H. (1996). Causal Testing. In W. Penczek &#38; A.
    Szalas (Eds.), <i>Mathematical Foundations of Computer Science 1996, 21st International
    Symposium, MFCS’96, Cracow, Poland, September 2-6, 1996, Proceedings</i> (pp.
    394--406). <a href="https://doi.org/10.1007/3-540-61550-4_165">https://doi.org/10.1007/3-540-61550-4_165</a>
  bibtex: '@inproceedings{Goltz_Wehrheim_1996, series={Lecture Notes in Computer Science},
    title={Causal Testing}, DOI={<a href="https://doi.org/10.1007/3-540-61550-4_165">10.1007/3-540-61550-4_165</a>},
    booktitle={Mathematical Foundations of Computer Science 1996, 21st International
    Symposium, MFCS’96, Cracow, Poland, September 2-6, 1996, Proceedings}, author={Goltz,
    Ursula and Wehrheim, Heike}, editor={Penczek, Wojciech and Szalas, AndrzejEditors},
    year={1996}, pages={394--406}, collection={Lecture Notes in Computer Science}
    }'
  chicago: Goltz, Ursula, and Heike Wehrheim. “Causal Testing.” In <i>Mathematical
    Foundations of Computer Science 1996, 21st International Symposium, MFCS’96, Cracow,
    Poland, September 2-6, 1996, Proceedings</i>, edited by Wojciech Penczek and Andrzej
    Szalas, 394--406. Lecture Notes in Computer Science, 1996. <a href="https://doi.org/10.1007/3-540-61550-4_165">https://doi.org/10.1007/3-540-61550-4_165</a>.
  ieee: U. Goltz and H. Wehrheim, “Causal Testing,” in <i>Mathematical Foundations
    of Computer Science 1996, 21st International Symposium, MFCS’96, Cracow, Poland,
    September 2-6, 1996, Proceedings</i>, 1996, pp. 394--406.
  mla: Goltz, Ursula, and Heike Wehrheim. “Causal Testing.” <i>Mathematical Foundations
    of Computer Science 1996, 21st International Symposium, MFCS’96, Cracow, Poland,
    September 2-6, 1996, Proceedings</i>, edited by Wojciech Penczek and Andrzej Szalas,
    1996, pp. 394--406, doi:<a href="https://doi.org/10.1007/3-540-61550-4_165">10.1007/3-540-61550-4_165</a>.
  short: 'U. Goltz, H. Wehrheim, in: W. Penczek, A. Szalas (Eds.), Mathematical Foundations
    of Computer Science 1996, 21st International Symposium, MFCS’96, Cracow, Poland,
    September 2-6, 1996, Proceedings, 1996, pp. 394--406.'
date_created: 2018-06-14T07:53:08Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
doi: 10.1007/3-540-61550-4_165
editor:
- first_name: Wojciech
  full_name: Penczek, Wojciech
  last_name: Penczek
- first_name: Andrzej
  full_name: Szalas, Andrzej
  last_name: Szalas
page: 394--406
publication: Mathematical Foundations of Computer Science 1996, 21st International
  Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Causal Testing
type: conference
user_id: '29719'
year: '1996'
...
---
_id: '17418'
author:
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Volker
  full_name: Stemann, Volker
  last_name: Stemann
citation:
  ama: Czumaj A, Meyer auf der Heide F, Stemann V. <i>Contention Resolution in Hashing
    Based Shared Memory Simulations</i>.; 1996.
  apa: Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1996). <i>Contention
    Resolution in Hashing Based Shared Memory Simulations</i>.
  bibtex: '@book{Czumaj_Meyer auf der Heide_Stemann_1996, series={Technical Report
    SFB, University of Paderborn}, title={Contention Resolution in Hashing Based Shared
    Memory Simulations}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm
    and Stemann, Volker}, year={1996}, collection={Technical Report SFB, University
    of Paderborn} }'
  chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. <i>Contention
    Resolution in Hashing Based Shared Memory Simulations</i>. Technical Report SFB,
    University of Paderborn, 1996.
  ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, <i>Contention Resolution
    in Hashing Based Shared Memory Simulations</i>. 1996.
  mla: Czumaj, Artur, et al. <i>Contention Resolution in Hashing Based Shared Memory
    Simulations</i>. 1996.
  short: A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing
    Based Shared Memory Simulations, 1996.
date_created: 2020-07-27T13:03:41Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
language:
- iso: eng
report_number: tr-rsfb-96-005
series_title: Technical Report SFB, University of Paderborn
status: public
title: Contention Resolution in Hashing Based Shared Memory Simulations
type: report
user_id: '15415'
year: '1996'
...
---
_id: '17419'
abstract:
- lang: eng
  text: We present a parallel algorithm for the rendering of complex three-dimensional
    scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting
    of a visualization-node, equipped with a powerful graphics adapter, and cluster
    nodes requiring weaker graphics capabilities only. The visualization-node renders
    a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes
    assist the visualization-node by asynchronous computing of Reliefboards, which
    are used to replace and render distant parts of the scene. Our algorithm is capable
    of gaining significant speedups if the cluster's nodes provide weak graphics adapters
    only. We trade the number of cluster nodes off the scene objects' image quality.
author:
- first_name: Dima
  full_name: Grigoriev, Dima
  last_name: Grigoriev
- first_name: Marek
  full_name: Karpinski, Marek
  last_name: Karpinski
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Roman
  full_name: Smolensky, Roman
  last_name: Smolensky
citation:
  ama: 'Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound
    for randomized algebraic decision trees. In: <i>Proc. of 28th ACM-STOC</i>. Vol
    65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics
    and Visualization; 1996:612-621.'
  apa: Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., &#38; Smolensky, R.
    (1996). A lower bound for randomized algebraic decision trees. In <i>Proc. of
    28th ACM-STOC</i> (Vol. 65453, pp. 612–621). Eurographics Symposium on Parallel
    Graphics and Visualization.
  bibtex: '@inproceedings{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1996,
    series={Lecture Notes in Computer Science}, title={A lower bound for randomized
    algebraic decision trees}, volume={65453}, booktitle={Proc. of 28th ACM-STOC},
    publisher={Eurographics Symposium on Parallel Graphics and Visualization}, author={Grigoriev,
    Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman},
    year={1996}, pages={612–621}, collection={Lecture Notes in Computer Science} }'
  chicago: Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman
    Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In <i>Proc.
    of 28th ACM-STOC</i>, 65453:612–21. Lecture Notes in Computer Science. Eurographics
    Symposium on Parallel Graphics and Visualization, 1996.
  ieee: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower
    bound for randomized algebraic decision trees,” in <i>Proc. of 28th ACM-STOC</i>,
    1996, vol. 65453, pp. 612–621.
  mla: Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.”
    <i>Proc. of 28th ACM-STOC</i>, vol. 65453, Eurographics Symposium on Parallel
    Graphics and Visualization, 1996, pp. 612–21.
  short: 'D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc.
    of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization,
    1996, pp. 612–621.'
date_created: 2020-07-27T13:09:09Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
intvolume: '     65453'
language:
- iso: eng
page: 612-621
publication: Proc. of 28th ACM-STOC
publisher: Eurographics Symposium on Parallel Graphics and Visualization
series_title: Lecture Notes in Computer Science
status: public
title: A lower bound for randomized algebraic decision trees
type: conference
user_id: '15415'
volume: 65453
year: '1996'
...
---
_id: '17483'
abstract:
- lang: eng
  text: "In this paper we develop a model for communication time on parallel computers
    consisting of processors and a service network, i.e., a network performing services
    like broadcast, synchronization, and global variables. The implementation of the
    service network is done on a free configurable Transputer network.\r\nOur cost
    model describes the communication time of accesses to global variables and consists
    of a multi-linear function. The cost model includes the parameters packet size,
    send hot spot, and the number of processors accessing global variables. These
    parameters influence the communication time in a high degree and capture important
    parameters like contention.\r\nWe implement a Bitonic Sort and a Connected Components
    algorithm (among others) and we show that our model is able to predict the communication
    time within a 10% error if indirect service networks are used. The applications
    show that it is easy for a programmer to determine the parameter values for our
    model and that our new cost model precisely predicts the communication time of
    parallel algorithms.\r\nFurthermore, we minimize the communication time of accesses
    to global variables by finding a balance between the number of messages in the
    network and their size. Our model predicts the optimal values for these parameters
    which we validate by experiments. A modified implementation of our routing which
    determines on-line the optimal parameter values for an access to a global variable
    achieves good speed ups."
author:
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Jochen
  full_name: Rethmann, Jochen
  last_name: Rethmann
- first_name: Alf
  full_name: Wachsmann, Alf
  last_name: Wachsmann
citation:
  ama: 'Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication
    Time in Parallel Programs. In: <i>3rd Workshop on Abstract Machine Models for
    Parallel and Distributed Computing (AMW ’96)</i>. Amsterdam: IOS Press; 1996:13–27.'
  apa: 'Fischer, M., Rethmann, J., &#38; Wachsmann, A. (1996). A Realistic Cost Model
    for the Communication Time in Parallel Programs. In <i>3rd Workshop on Abstract
    Machine Models for Parallel and Distributed Computing (AMW ’96)</i> (pp. 13–27).
    Amsterdam: IOS Press.'
  bibtex: '@inproceedings{Fischer_Rethmann_Wachsmann_1996, place={Amsterdam}, title={A
    Realistic Cost Model for the Communication Time in Parallel Programs}, booktitle={3rd
    Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW
    ’96)}, publisher={IOS Press}, author={Fischer, Matthias and Rethmann, Jochen and
    Wachsmann, Alf}, year={1996}, pages={13–27} }'
  chicago: 'Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. “A Realistic Cost
    Model for the Communication Time in Parallel Programs.” In <i>3rd Workshop on
    Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i>,
    13–27. Amsterdam: IOS Press, 1996.'
  ieee: M. Fischer, J. Rethmann, and A. Wachsmann, “A Realistic Cost Model for the
    Communication Time in Parallel Programs,” in <i>3rd Workshop on Abstract Machine
    Models for Parallel and Distributed Computing (AMW ’96)</i>, 1996, pp. 13–27.
  mla: Fischer, Matthias, et al. “A Realistic Cost Model for the Communication Time
    in Parallel Programs.” <i>3rd Workshop on Abstract Machine Models for Parallel
    and Distributed Computing (AMW ’96)</i>, IOS Press, 1996, pp. 13–27.
  short: 'M. Fischer, J. Rethmann, A. Wachsmann, in: 3rd Workshop on Abstract Machine
    Models for Parallel and Distributed Computing (AMW ’96), IOS Press, Amsterdam,
    1996, pp. 13–27.'
date_created: 2020-07-30T14:45:12Z
date_updated: 2022-01-06T06:53:13Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-08-26T10:15:36Z
  date_updated: 2020-08-26T10:15:36Z
  file_id: '18354'
  file_name: hni-1454.pdf
  file_size: 285707
  relation: main_file
  success: 1
file_date_updated: 2020-08-26T10:15:36Z
has_accepted_license: '1'
language:
- iso: eng
page: 13–27
place: Amsterdam
publication: 3rd Workshop on Abstract Machine Models for Parallel and Distributed
  Computing (AMW '96)
publication_identifier:
  isbn:
  - 905199267X
publisher: IOS Press
status: public
title: A Realistic Cost Model for the Communication Time in Parallel Programs
type: conference
user_id: '15415'
year: '1996'
...
---
_id: '17564'
author:
- first_name: Armin
  full_name: Bäumker, Armin
  last_name: Bäumker
- first_name: Wolfgang
  full_name: Dittrich, Wolfgang
  last_name: Dittrich
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Ingo
  full_name: Rieping, Ingo
  last_name: Rieping
citation:
  ama: 'Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel
    algorithms: Priority queue operations and selection for the BSP* Model. In: <i>Lecture
    Notes in Computer Science</i>. Berlin, Heidelberg; 1996:369-376. doi:<a href="https://doi.org/10.1007/bfb0024725">10.1007/bfb0024725</a>'
  apa: 'Bäumker, A., Dittrich, W., Meyer auf der Heide, F., &#38; Rieping, I. (1996).
    Realistic parallel algorithms: Priority queue operations and selection for the
    BSP* Model. In <i>Lecture Notes in Computer Science</i> (pp. 369–376). Berlin,
    Heidelberg. <a href="https://doi.org/10.1007/bfb0024725">https://doi.org/10.1007/bfb0024725</a>'
  bibtex: '@inbook{Bäumker_Dittrich_Meyer auf der Heide_Rieping_1996, place={Berlin,
    Heidelberg}, title={Realistic parallel algorithms: Priority queue operations and
    selection for the BSP* Model}, DOI={<a href="https://doi.org/10.1007/bfb0024725">10.1007/bfb0024725</a>},
    booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich,
    Wolfgang and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={1996}, pages={369–376}
    }'
  chicago: 'Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and
    Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection
    for the BSP* Model.” In <i>Lecture Notes in Computer Science</i>, 369–76. Berlin,
    Heidelberg, 1996. <a href="https://doi.org/10.1007/bfb0024725">https://doi.org/10.1007/bfb0024725</a>.'
  ieee: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping, “Realistic
    parallel algorithms: Priority queue operations and selection for the BSP* Model,”
    in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1996, pp. 369–376.'
  mla: 'Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations
    and Selection for the BSP* Model.” <i>Lecture Notes in Computer Science</i>, 1996,
    pp. 369–76, doi:<a href="https://doi.org/10.1007/bfb0024725">10.1007/bfb0024725</a>.'
  short: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture
    Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.'
date_created: 2020-08-03T13:11:02Z
date_updated: 2022-01-06T06:53:15Z
department:
- _id: '63'
doi: 10.1007/bfb0024725
language:
- iso: eng
page: 369-376
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540616276'
  - '9783540706366'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: 'Realistic parallel algorithms: Priority queue operations and selection for
  the BSP* Model'
type: book_chapter
user_id: '15415'
year: '1996'
...
---
_id: '1918'
author:
- first_name: Bernd
  full_name: Dreier, Bernd
  last_name: Dreier
- first_name: Annja
  full_name: Huber, Annja
  last_name: Huber
- first_name: 'Markus '
  full_name: 'Zahn, Markus '
  last_name: Zahn
- first_name: Holger
  full_name: Karl, Holger
  last_name: Karl
- first_name: Theo
  full_name: Ungerer, Theo
  last_name: Ungerer
citation:
  ama: 'Dreier B, Huber A, Zahn M, Karl H, Ungerer T. ReGTime - Rent Gigaflops someTimes.
    In: <i>Proceedings Trends in Distributed Systems</i>. ; 1996.'
  apa: Dreier, B., Huber, A., Zahn, M., Karl, H., &#38; Ungerer, T. (1996). ReGTime
    - Rent Gigaflops someTimes. In <i>Proceedings Trends in Distributed Systems</i>.
  bibtex: '@inproceedings{Dreier_Huber_Zahn_Karl_Ungerer_1996, title={ReGTime - Rent
    Gigaflops someTimes}, booktitle={Proceedings Trends in Distributed Systems}, author={Dreier,
    Bernd and Huber, Annja and Zahn, Markus  and Karl, Holger and Ungerer, Theo},
    year={1996} }'
  chicago: Dreier, Bernd, Annja Huber, Markus  Zahn, Holger Karl, and Theo Ungerer.
    “ReGTime - Rent Gigaflops SomeTimes.” In <i>Proceedings Trends in Distributed
    Systems</i>, 1996.
  ieee: B. Dreier, A. Huber, M. Zahn, H. Karl, and T. Ungerer, “ReGTime - Rent Gigaflops
    someTimes,” in <i>Proceedings Trends in Distributed Systems</i>, 1996.
  mla: Dreier, Bernd, et al. “ReGTime - Rent Gigaflops SomeTimes.” <i>Proceedings
    Trends in Distributed Systems</i>, 1996.
  short: 'B. Dreier, A. Huber, M. Zahn, H. Karl, T. Ungerer, in: Proceedings Trends
    in Distributed Systems, 1996.'
date_created: 2018-03-28T11:31:47Z
date_updated: 2022-01-06T06:53:59Z
department:
- _id: '75'
publication: Proceedings Trends in Distributed Systems
status: public
title: ReGTime - Rent Gigaflops someTimes
type: conference
user_id: '15572'
year: '1996'
...
---
_id: '18352'
abstract:
- lang: eng
  text: "In this report, we develop a cost model for the communication time on parallel
    computers consisting of processors and a service network, i.e., a network performing
    services like broadcast, synchronization, and global variables. Because we do
    not have a parallel computer at our disposal that is equipped with a service network,
    we emulate the service network on a reconfigurable Transputer network.\r\nOur
    cost model describes the communication time of accesses to global variables and
    consists of a multi­linear function. The cost model includes the parameters packet
    size, send hot spot (the number of messages sent out by one processor), and number
    of processors accessing global variables. We show that these parameters influence
    the communication time in a high degree and capture important parameters like
    network contention.\r\nWe implement a Bitonic Sort, Sample Sort, Matrix Multiplication,
    and Connected Components algorithm, and we show that our model is able to predict
    the communication time within a 10% error if indirect service networks are used.
    The applications show that it is easy for a programer to determine the parameter
    values for our model and that our new cost model precisely predicts the communication
    time of parallel algorithms.\r\nWe explore the interaction of hot spots and asynchrony
    and show that the influence of hot spots to the communication time is not as high
    as one would expect from theoretical considerations in a synchronous model. Therefore,
    we do not apprehend the hot spot in our cost model.\r\nFurthermore, we minimize
    the communication time of accesses to global variables by finding a balance between
    the number of messages in the network and their size. Our model predicts the optimal
    values for these parameters which we validate by experiments. A modified implementation
    of our routing which determines on­line the optimal parameter values for an access
    to a global variable achieves good speed ups.\r\n"
author:
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Jochen
  full_name: Rethmann, Jochen
  last_name: Rethmann
- first_name: Alf
  full_name: Wachsmann, Alf
  last_name: Wachsmann
citation:
  ama: Fischer M, Rethmann J, Wachsmann A. <i>A Realistic Cost Model for the Communication
    Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>.
    Universität Paderborn; 1996.
  apa: Fischer, M., Rethmann, J., &#38; Wachsmann, A. (1996). <i>A Realistic Cost
    Model for the Communication Time in Parallel Programs on Parallel Computers Using
    a Service Hardware</i>. Universität Paderborn.
  bibtex: '@book{Fischer_Rethmann_Wachsmann_1996, place={Universität Paderborn}, title={A
    Realistic Cost Model for the Communication Time in Parallel Programs on Parallel
    Computers Using a Service Hardware}, author={Fischer, Matthias and Rethmann, Jochen
    and Wachsmann, Alf}, year={1996} }'
  chicago: Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. <i>A Realistic Cost
    Model for the Communication Time in Parallel Programs on Parallel Computers Using
    a Service Hardware</i>. Universität Paderborn, 1996.
  ieee: M. Fischer, J. Rethmann, and A. Wachsmann, <i>A Realistic Cost Model for the
    Communication Time in Parallel Programs on Parallel Computers Using a Service
    Hardware</i>. Universität Paderborn, 1996.
  mla: Fischer, Matthias, et al. <i>A Realistic Cost Model for the Communication Time
    in Parallel Programs on Parallel Computers Using a Service Hardware</i>. 1996.
  short: M. Fischer, J. Rethmann, A. Wachsmann, A Realistic Cost Model for the Communication
    Time in Parallel Programs on Parallel Computers Using a Service Hardware, Universität
    Paderborn, 1996.
date_created: 2020-08-26T10:06:31Z
date_updated: 2022-01-06T06:53:30Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-08-26T10:05:35Z
  date_updated: 2020-08-26T10:05:35Z
  file_id: '18353'
  file_name: tr-rsfb-96-007.pdf
  file_size: 519632
  relation: main_file
  success: 1
file_date_updated: 2020-08-26T10:05:35Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Paderborn
status: public
title: A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel
  Computers Using a Service Hardware
type: report
user_id: '15415'
year: '1996'
...
---
_id: '2181'
author:
- first_name: Christian
  full_name: Scheideler, Christian
  last_name: Scheideler
citation:
  ama: Scheideler C. <i>Universal Routing Strategies</i>. University of Paderborn,
    Germany; 1996.
  apa: Scheideler, C. (1996). <i>Universal routing strategies</i>. University of Paderborn,
    Germany.
  bibtex: '@book{Scheideler_1996, title={Universal routing strategies}, publisher={University
    of Paderborn, Germany}, author={Scheideler, Christian}, year={1996} }'
  chicago: Scheideler, Christian. <i>Universal Routing Strategies</i>. University
    of Paderborn, Germany, 1996.
  ieee: C. Scheideler, <i>Universal routing strategies</i>. University of Paderborn,
    Germany, 1996.
  mla: Scheideler, Christian. <i>Universal Routing Strategies</i>. University of Paderborn,
    Germany, 1996.
  short: C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany,
    1996.
date_created: 2018-04-03T09:29:45Z
date_updated: 2022-01-06T06:55:15Z
department:
- _id: '79'
- _id: '63'
language:
- iso: eng
publisher: University of Paderborn, Germany
status: public
title: Universal routing strategies
type: dissertation
user_id: '14955'
year: '1996'
...
---
_id: '2182'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Volker
  full_name: Stemann, Volker
  last_name: Stemann
citation:
  ama: Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy
    to Speed up Randomized Shared Memory Simulations. <i>Theor Comput Sci</i>. 1996;(2):245--281.
    doi:<a href="https://doi.org/10.1016/0304-3975(96)00032-1">10.1016/0304-3975(96)00032-1</a>
  apa: Meyer auf der Heide, F., Scheideler, C., &#38; Stemann, V. (1996). Exploiting
    Storage Redundancy to Speed up Randomized Shared Memory Simulations. <i>Theor.
    Comput. Sci.</i>, (2), 245--281. <a href="https://doi.org/10.1016/0304-3975(96)00032-1">https://doi.org/10.1016/0304-3975(96)00032-1</a>
  bibtex: '@article{Meyer auf der Heide_Scheideler_Stemann_1996, title={Exploiting
    Storage Redundancy to Speed up Randomized Shared Memory Simulations}, DOI={<a
    href="https://doi.org/10.1016/0304-3975(96)00032-1">10.1016/0304-3975(96)00032-1</a>},
    number={2}, journal={Theor. Comput. Sci.}, author={Meyer auf der Heide, Friedhelm
    and Scheideler, Christian and Stemann, Volker}, year={1996}, pages={245--281}
    }'
  chicago: 'Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann.
    “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.”
    <i>Theor. Comput. Sci.</i>, no. 2 (1996): 245--281. <a href="https://doi.org/10.1016/0304-3975(96)00032-1">https://doi.org/10.1016/0304-3975(96)00032-1</a>.'
  ieee: F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage
    Redundancy to Speed up Randomized Shared Memory Simulations,” <i>Theor. Comput.
    Sci.</i>, no. 2, pp. 245--281, 1996.
  mla: Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed
    up Randomized Shared Memory Simulations.” <i>Theor. Comput. Sci.</i>, no. 2, 1996,
    pp. 245--281, doi:<a href="https://doi.org/10.1016/0304-3975(96)00032-1">10.1016/0304-3975(96)00032-1</a>.
  short: F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996)
    245--281.
date_created: 2018-04-03T09:30:20Z
date_updated: 2022-01-06T06:55:16Z
department:
- _id: '79'
- _id: '63'
doi: 10.1016/0304-3975(96)00032-1
issue: '2'
language:
- iso: eng
page: 245--281
publication: Theor. Comput. Sci.
status: public
title: Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations
type: journal_article
user_id: '14955'
year: '1996'
...
---
_id: '2183'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers:
    Turning Offline into Online Protocols. In: <i>FOCS</i>. ; 1996:370--379.'
  apa: 'Meyer auf der Heide, F., &#38; Scheideler, C. (1996). Deterministic Routing
    with Bounded Buffers: Turning Offline into Online Protocols. In <i>FOCS</i> (pp.
    370--379).'
  bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_1996, title={Deterministic
    Routing with Bounded Buffers: Turning Offline into Online Protocols}, booktitle={FOCS},
    author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996},
    pages={370--379} }'
  chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic
    Routing with Bounded Buffers: Turning Offline into Online Protocols.” In <i>FOCS</i>,
    370--379, 1996.'
  ieee: 'F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded
    Buffers: Turning Offline into Online Protocols,” in <i>FOCS</i>, 1996, pp. 370--379.'
  mla: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing
    with Bounded Buffers: Turning Offline into Online Protocols.” <i>FOCS</i>, 1996,
    pp. 370--379.'
  short: 'F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.'
date_created: 2018-04-03T09:31:52Z
date_updated: 2022-01-06T06:55:17Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T07:01:11Z
  date_updated: 2018-04-12T07:10:17Z
  file_id: '2281'
  file_name: FOCS96.pdf
  file_size: 248409
  relation: main_file
file_date_updated: 2018-04-12T07:10:17Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 370--379
publication: FOCS
status: public
title: 'Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols'
type: conference
urn: '21832'
user_id: '14955'
year: '1996'
...
---
_id: '2184'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In:
    <i>SOFSEM</i>. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.'
  apa: Meyer auf der Heide, F., &#38; Scheideler, C. (1996). Communication in Parallel
    Systems. In <i>SOFSEM</i> (Vol. 1175, pp. 16--33). Springer.
  bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_1996, series={Lecture Notes
    in Computer Science}, title={Communication in Parallel Systems}, volume={1175},
    booktitle={SOFSEM}, publisher={Springer}, author={Meyer auf der Heide, Friedhelm
    and Scheideler, Christian}, year={1996}, pages={16--33}, collection={Lecture Notes
    in Computer Science} }'
  chicago: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication
    in Parallel Systems.” In <i>SOFSEM</i>, 1175:16--33. Lecture Notes in Computer
    Science. Springer, 1996.
  ieee: F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,”
    in <i>SOFSEM</i>, 1996, vol. 1175, pp. 16--33.
  mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in
    Parallel Systems.” <i>SOFSEM</i>, vol. 1175, Springer, 1996, pp. 16--33.
  short: 'F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.'
date_created: 2018-04-03T09:32:47Z
date_updated: 2022-01-06T06:55:17Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T07:01:59Z
  date_updated: 2018-04-12T07:10:36Z
  file_id: '2282'
  file_name: SOFSEM96.pdf
  file_size: 597639
  relation: main_file
file_date_updated: 2018-04-12T07:10:36Z
has_accepted_license: '1'
intvolume: '      1175'
language:
- iso: eng
oa: '1'
page: 16--33
publication: SOFSEM
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Communication in Parallel Systems
type: conference
urn: '21840'
user_id: '14955'
volume: 1175
year: '1996'
...
---
_id: '2186'
author:
- first_name: Robert
  full_name: Cypher, Robert
  last_name: Cypher
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Berthold
  full_name: Vöcking, Berthold
  last_name: Vöcking
citation:
  ama: 'Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking B. Universal Algorithms
    for Store-and-Forward and Wormhole Routing. In: <i>STOC</i>. ACM; 1996:356--365.'
  apa: Cypher, R., Meyer auf der Heide, F., Scheideler, C., &#38; Vöcking, B. (1996).
    Universal Algorithms for Store-and-Forward and Wormhole Routing. In <i>STOC</i>
    (pp. 356--365). ACM.
  bibtex: '@inproceedings{Cypher_Meyer auf der Heide_Scheideler_Vöcking_1996, title={Universal
    Algorithms for Store-and-Forward and Wormhole Routing}, booktitle={STOC}, publisher={ACM},
    author={Cypher, Robert and Meyer auf der Heide, Friedhelm and Scheideler, Christian
    and Vöcking, Berthold}, year={1996}, pages={356--365} }'
  chicago: Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and
    Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.”
    In <i>STOC</i>, 356--365. ACM, 1996.
  ieee: R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking, “Universal
    Algorithms for Store-and-Forward and Wormhole Routing,” in <i>STOC</i>, 1996,
    pp. 356--365.
  mla: Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole
    Routing.” <i>STOC</i>, ACM, 1996, pp. 356--365.
  short: 'R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC,
    ACM, 1996, pp. 356--365.'
date_created: 2018-04-03T09:39:17Z
date_updated: 2022-01-06T06:55:18Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T06:58:59Z
  date_updated: 2018-04-12T07:11:03Z
  file_id: '2280'
  file_name: STOC96.pdf
  file_size: 700595
  relation: main_file
file_date_updated: 2018-04-12T07:11:03Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 356--365
publication: STOC
publisher: ACM
status: public
title: Universal Algorithms for Store-and-Forward and Wormhole Routing
type: conference
urn: '21868'
user_id: '14955'
year: '1996'
...
---
_id: '7796'
citation:
  ama: 'Engels G, Ehrig H, Rozenberg G, Skowron A, eds. <i>Special Issue on Graph
    Transformations</i>. Vol 26. Amsterdam: IOS Press; 1996.'
  apa: 'Engels, G., Ehrig, H., Rozenberg, G., &#38; Skowron, A. (Eds.). (1996). <i>Special
    Issue on Graph Transformations</i> (Vol. 26). Amsterdam: IOS Press.'
  bibtex: '@book{Engels_Ehrig_Rozenberg_Skowron_1996, place={Amsterdam}, series={Fundamenta
    Informaticae}, title={Special Issue on Graph Transformations}, volume={26}, number={3–4},
    publisher={IOS Press}, year={1996}, collection={Fundamenta Informaticae} }'
  chicago: 'Engels, Gregor, Hartmut Ehrig, Grzegorz Rozenberg, and Andrzej Skowron,
    eds. <i>Special Issue on Graph Transformations</i>. Vol. 26. Fundamenta Informaticae.
    Amsterdam: IOS Press, 1996.'
  ieee: 'G. Engels, H. Ehrig, G. Rozenberg, and A. Skowron, Eds., <i>Special Issue
    on Graph Transformations</i>, vol. 26, no. 3–4. Amsterdam: IOS Press, 1996.'
  mla: Engels, Gregor, et al., editors. <i>Special Issue on Graph Transformations</i>.
    Vol. 26, no. 3–4, IOS Press, 1996.
  short: G. Engels, H. Ehrig, G. Rozenberg, A. Skowron, eds., Special Issue on Graph
    Transformations, IOS Press, Amsterdam, 1996.
date_created: 2019-02-19T19:17:49Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
editor:
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Hartmut
  full_name: Ehrig, Hartmut
  last_name: Ehrig
- first_name: Grzegorz
  full_name: Rozenberg, Grzegorz
  last_name: Rozenberg
- first_name: Andrzej
  full_name: Skowron, Andrzej
  last_name: Skowron
intvolume: '        26'
issue: 3-4
language:
- iso: eng
place: Amsterdam
publisher: IOS Press
series_title: Fundamenta Informaticae
status: public
title: Special Issue on Graph Transformations
type: conference_editor
user_id: '52534'
volume: 26
year: '1996'
...
---
_id: '7834'
abstract:
- lang: eng
  text: The concept of views is used on two levels. First, so-called design views
    are developed for structuring specifications, that is, a system is modeled according
    to different views (e.g., representing the needs of different kinds of users)
    which have to be synchronized afterwards in order to build the whole system. Views
    can be specified by means of typed graph transformation systems, where the type
    graph determines the visible types and the productions describe the known operations
    of that view. The synchronization of views is done by the construction of cooperative
    parallel composition of graph transformation systems, developed by Leila Ribeiro
    and presented at the same seminar. If the specification is complete, a view may
    describe an observation of the system in operation. In this case we speak of a
    user view. It turns out that the semantics of such a view cannot be described
    by computations (i.e., graph transformations), but just by observations of computations
    of the global system. Such observations of computations cannot be represented
    by graph transformations in the usual sense because a local view may lack operations
    (productions) of the global system, so that state changes may be observed that
    do not have a cause in the local view. Therefore, the notion of graph transition
    is introduced as loose semantics for productions, where the production specifies
    only a lower bound to the activities that are to happen during application. Contrastingly,
    in the classical doublepushout approach to graph rewriting, productions are interpreted
    as complete descriptions of the transformations to be performed. For typed graph
    transformation systems a transition sequence semantics is developed, comprising
    all finite and infinite sequences of transitions in a system. Moreover, this semantics
    is shown to be compositional w.r.t. the synchronization of views.
author:
- first_name: Hartmut
  full_name: Ehrig, Hartmut
  last_name: Ehrig
- first_name: Reiko
  full_name: Heckel, Reiko
  last_name: Heckel
- first_name: Julia
  full_name: Padberg, Julia
  last_name: Padberg
- first_name: Gabriele
  full_name: Taentzer, Gabriele
  last_name: Taentzer
- first_name: Uwe
  full_name: Wolter, Uwe
  last_name: Wolter
- first_name: Andrea
  full_name: Corradini, Andrea
  last_name: Corradini
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Ehrig H, Heckel R, Padberg J, et al. Synchronization of Views and Loose Semantics
    of Typed Graph Productions. In: <i>Report on the Dagstuhl-Seminar 9637 on Graph
    Transformations in Computer Science</i>. Technical University of Berlin; 1996:11-12.'
  apa: Ehrig, H., Heckel, R., Padberg, J., Taentzer, G., Wolter, U., Corradini, A.,
    &#38; Engels, G. (1996). Synchronization of Views and Loose Semantics of Typed
    Graph Productions. In <i>Report on the Dagstuhl-Seminar 9637 on Graph Transformations
    in Computer Science</i> (pp. 11–12). Technical University of Berlin.
  bibtex: '@inproceedings{Ehrig_Heckel_Padberg_Taentzer_Wolter_Corradini_Engels_1996,
    title={Synchronization of Views and Loose Semantics of Typed Graph Productions},
    number={155}, booktitle={Report on the Dagstuhl-Seminar 9637 on Graph Transformations
    in Computer Science}, publisher={Technical University of Berlin}, author={Ehrig,
    Hartmut and Heckel, Reiko and Padberg, Julia and Taentzer, Gabriele and Wolter,
    Uwe and Corradini, Andrea and Engels, Gregor}, year={1996}, pages={11–12} }'
  chicago: Ehrig, Hartmut, Reiko Heckel, Julia Padberg, Gabriele Taentzer, Uwe Wolter,
    Andrea Corradini, and Gregor Engels. “Synchronization of Views and Loose Semantics
    of Typed Graph Productions.” In <i>Report on the Dagstuhl-Seminar 9637 on Graph
    Transformations in Computer Science</i>, 11–12. Technical University of Berlin,
    1996.
  ieee: H. Ehrig <i>et al.</i>, “Synchronization of Views and Loose Semantics of Typed
    Graph Productions,” in <i>Report on the Dagstuhl-Seminar 9637 on Graph Transformations
    in Computer Science</i>, 1996, no. 155, pp. 11–12.
  mla: Ehrig, Hartmut, et al. “Synchronization of Views and Loose Semantics of Typed
    Graph Productions.” <i>Report on the Dagstuhl-Seminar 9637 on Graph Transformations
    in Computer Science</i>, no. 155, Technical University of Berlin, 1996, pp. 11–12.
  short: 'H. Ehrig, R. Heckel, J. Padberg, G. Taentzer, U. Wolter, A. Corradini, G.
    Engels, in: Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer
    Science, Technical University of Berlin, 1996, pp. 11–12.'
date_created: 2019-02-20T14:02:31Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
issue: '155'
language:
- iso: eng
page: 11-12
publication: Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer
  Science
publisher: Technical University of Berlin
status: public
title: Synchronization of Views and Loose Semantics of Typed Graph Productions
type: conference
user_id: '52534'
year: '1996'
...
---
_id: '7835'
author:
- first_name: Reiko
  full_name: Heckel, Reiko
  last_name: Heckel
citation:
  ama: 'Heckel R. Behavioral Constraints for Loose Graph Transformation Systems. In:
    <i>Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science</i>.
    Dagstuhl-Seminar-Report. Technical University of Berlin; 1996:12-13.'
  apa: Heckel, R. (1996). Behavioral Constraints for Loose Graph Transformation Systems.
    In <i>Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer
    Science</i> (pp. 12–13). Technical University of Berlin.
  bibtex: '@inproceedings{Heckel_1996, series={Dagstuhl-Seminar-Report}, title={Behavioral
    Constraints for Loose Graph Transformation Systems}, number={155}, booktitle={Report
    on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science}, publisher={Technical
    University of Berlin}, author={Heckel, Reiko}, year={1996}, pages={12–13}, collection={Dagstuhl-Seminar-Report}
    }'
  chicago: Heckel, Reiko. “Behavioral Constraints for Loose Graph Transformation Systems.”
    In <i>Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer
    Science</i>, 12–13. Dagstuhl-Seminar-Report. Technical University of Berlin, 1996.
  ieee: R. Heckel, “Behavioral Constraints for Loose Graph Transformation Systems,”
    in <i>Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer
    Science</i>, 1996, no. 155, pp. 12–13.
  mla: Heckel, Reiko. “Behavioral Constraints for Loose Graph Transformation Systems.”
    <i>Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science</i>,
    no. 155, Technical University of Berlin, 1996, pp. 12–13.
  short: 'R. Heckel, in: Report on the Dagstuhl-Seminar 9637 on Graph Transformations
    in Computer Science, Technical University of Berlin, 1996, pp. 12–13.'
date_created: 2019-02-20T14:03:34Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
issue: '155'
language:
- iso: eng
page: 12-13
publication: Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer
  Science
publisher: Technical University of Berlin
series_title: Dagstuhl-Seminar-Report
status: public
title: Behavioral Constraints for Loose Graph Transformation Systems
type: conference
user_id: '52534'
year: '1996'
...
---
_id: '7836'
abstract:
- lang: eng
  text: A large industrial process, software maintenance, has been modelled by using
    the process modelling language SOCCA. The paper reports about the experiences
    with this trial. In particular, feasibility, expressiveness, quality and the overall
    benefits of a formal SOCCA model are discussed and compared to the formerly existing
    informal process description. In order to illustrate the results, a well chosen
    process model fragment from the larger model is outlined in detail. It addresses
    in particular the human-intensive cooperation within the process and shows the
    seamless combination of technical components and human agent components in the
    SOCCA model. The main conclusions from this trial are that formal SOCCA models
    are suited to model realistic industrial processes and that due to an intrinsic
    modular structure of a SOCCA model, even huge models remain reasonably readable
    and understandable
author:
- first_name: Tineke
  full_name: de Bunje, Tineke
  last_name: de Bunje
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Luuk
  full_name: Groenewegen, Luuk
  last_name: Groenewegen
- first_name: Aart
  full_name: Matsinger, Aart
  last_name: Matsinger
- first_name: Martin
  full_name: Rijnbeek, Martin
  last_name: Rijnbeek
citation:
  ama: 'de Bunje T, Engels G, Groenewegen L, Matsinger A, Rijnbeek M. Industrial maintenance
    modelled in SOCCA: an experience report. In: <i>Proceedings of the Fourth International
    Conference on the Software Process (ICSP 1996), Brighton (UK)</i>. Washington,
    DC, USA: IEEE Computer Society; 1996:13-26. doi:<a href="http://dx.doi.org/10.1109/ICSP.1996.565021">http://dx.doi.org/10.1109/ICSP.1996.565021</a>'
  apa: 'de Bunje, T., Engels, G., Groenewegen, L., Matsinger, A., &#38; Rijnbeek,
    M. (1996). Industrial maintenance modelled in SOCCA: an experience report. In
    <i>Proceedings of the Fourth International Conference on the Software Process
    (ICSP 1996), Brighton (UK)</i> (pp. 13–26). Washington, DC, USA: IEEE Computer
    Society. <a href="http://dx.doi.org/10.1109/ICSP.1996.565021">http://dx.doi.org/10.1109/ICSP.1996.565021</a>'
  bibtex: '@inproceedings{de Bunje_Engels_Groenewegen_Matsinger_Rijnbeek_1996, place={Washington,
    DC, USA}, title={Industrial maintenance modelled in SOCCA: an experience report},
    DOI={<a href="http://dx.doi.org/10.1109/ICSP.1996.565021">http://dx.doi.org/10.1109/ICSP.1996.565021</a>},
    booktitle={Proceedings of the Fourth International Conference on the Software
    Process (ICSP 1996), Brighton (UK)}, publisher={IEEE Computer Society}, author={de
    Bunje, Tineke and Engels, Gregor and Groenewegen, Luuk and Matsinger, Aart and
    Rijnbeek, Martin}, year={1996}, pages={13–26} }'
  chicago: 'Bunje, Tineke de, Gregor Engels, Luuk Groenewegen, Aart Matsinger, and
    Martin Rijnbeek. “Industrial Maintenance Modelled in SOCCA: An Experience Report.”
    In <i>Proceedings of the Fourth International Conference on the Software Process
    (ICSP 1996), Brighton (UK)</i>, 13–26. Washington, DC, USA: IEEE Computer Society,
    1996. <a href="http://dx.doi.org/10.1109/ICSP.1996.565021">http://dx.doi.org/10.1109/ICSP.1996.565021</a>.'
  ieee: 'T. de Bunje, G. Engels, L. Groenewegen, A. Matsinger, and M. Rijnbeek, “Industrial
    maintenance modelled in SOCCA: an experience report,” in <i>Proceedings of the
    Fourth International Conference on the Software Process (ICSP 1996), Brighton
    (UK)</i>, 1996, pp. 13–26.'
  mla: 'de Bunje, Tineke, et al. “Industrial Maintenance Modelled in SOCCA: An Experience
    Report.” <i>Proceedings of the Fourth International Conference on the Software
    Process (ICSP 1996), Brighton (UK)</i>, IEEE Computer Society, 1996, pp. 13–26,
    doi:<a href="http://dx.doi.org/10.1109/ICSP.1996.565021">http://dx.doi.org/10.1109/ICSP.1996.565021</a>.'
  short: 'T. de Bunje, G. Engels, L. Groenewegen, A. Matsinger, M. Rijnbeek, in: Proceedings
    of the Fourth International Conference on the Software Process (ICSP 1996), Brighton
    (UK), IEEE Computer Society, Washington, DC, USA, 1996, pp. 13–26.'
date_created: 2019-02-20T14:03:55Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
doi: http://dx.doi.org/10.1109/ICSP.1996.565021
language:
- iso: eng
page: 13-26
place: Washington, DC, USA
publication: Proceedings of the Fourth International Conference on the Software Process
  (ICSP 1996), Brighton (UK)
publisher: IEEE Computer Society
status: public
title: 'Industrial maintenance modelled in SOCCA: an experience report'
type: conference
user_id: '52534'
year: '1996'
...
---
_id: '7837'
abstract:
- lang: eng
  text: In order to manage the complexity of large system specifications, they have
    to be decomposed into subspecifications. Each subspecification describes a certain
    part of the system. This might be a certain aspect, like the data, dynamic, or
    functional aspect, as it is known from object-oriented modelling techniques. Or
    it might be a certain view onto the system, as it is known from database modelling
    techniques. The talk motivates the usage of views in graph grammarbased specifications.
    First, the usage of typed graph grammars inherently ensures an integration of
    the data and the functional aspect within a view. Second, it is explained that
    it is not appropriate in case of views to have a fixed semantics. The standard
    fixed semantics, i.e. a graph transformation system, has to be relaxed to a loose
    semantics, i.e. a graph transition system. This reflects the idea that a view
    models only a part of the complete system. Other views may overlap a view with
    respect to data or functionality. A complete system specification is yielded by
    exploiting the approach of cooperative parallel composition of graph grammars
    (see talk by Leila Ribeiro).
author:
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Hartmut
  full_name: Ehrig, Hartmut
  last_name: Ehrig
- first_name: Reiko
  full_name: Heckel, Reiko
  last_name: Heckel
- first_name: Gabriele
  full_name: Taentzer, Gabriele
  last_name: Taentzer
- first_name: Andrea
  full_name: Corradini, Andrea
  last_name: Corradini
citation:
  ama: 'Engels G, Ehrig H, Heckel R, Taentzer G, Corradini A. A View-Based Approach
    to System Modelling. In: <i>Report on Dagstuhl-Seminar 9637 on Graph Transformations
    in Computer Science</i>. Vol 155. Dagstuhl-Seminar-Report. Technical University
    of Berlin; 1996:11.'
  apa: Engels, G., Ehrig, H., Heckel, R., Taentzer, G., &#38; Corradini, A. (1996).
    A View-Based Approach to System Modelling. In <i>Report on Dagstuhl-Seminar 9637
    on Graph Transformations in Computer Science</i> (Vol. 155, p. 11). Technical
    University of Berlin.
  bibtex: '@inproceedings{Engels_Ehrig_Heckel_Taentzer_Corradini_1996, series={Dagstuhl-Seminar-Report},
    title={A View-Based Approach to System Modelling}, volume={155}, booktitle={Report
    on Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science}, publisher={Technical
    University of Berlin}, author={Engels, Gregor and Ehrig, Hartmut and Heckel, Reiko
    and Taentzer, Gabriele and Corradini, Andrea}, year={1996}, pages={11}, collection={Dagstuhl-Seminar-Report}
    }'
  chicago: Engels, Gregor, Hartmut Ehrig, Reiko Heckel, Gabriele Taentzer, and Andrea
    Corradini. “A View-Based Approach to System Modelling.” In <i>Report on Dagstuhl-Seminar
    9637 on Graph Transformations in Computer Science</i>, 155:11. Dagstuhl-Seminar-Report.
    Technical University of Berlin, 1996.
  ieee: G. Engels, H. Ehrig, R. Heckel, G. Taentzer, and A. Corradini, “A View-Based
    Approach to System Modelling,” in <i>Report on Dagstuhl-Seminar 9637 on Graph
    Transformations in Computer Science</i>, 1996, vol. 155, p. 11.
  mla: Engels, Gregor, et al. “A View-Based Approach to System Modelling.” <i>Report
    on Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science</i>, vol.
    155, Technical University of Berlin, 1996, p. 11.
  short: 'G. Engels, H. Ehrig, R. Heckel, G. Taentzer, A. Corradini, in: Report on
    Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science, Technical
    University of Berlin, 1996, p. 11.'
date_created: 2019-02-20T14:04:54Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
intvolume: '       155'
language:
- iso: eng
page: '11'
publication: Report on Dagstuhl-Seminar 9637 on Graph Transformations in Computer
  Science
publisher: Technical University of Berlin
series_title: Dagstuhl-Seminar-Report
status: public
title: A View-Based Approach to System Modelling
type: conference
user_id: '52534'
volume: 155
year: '1996'
...
---
_id: '7838'
abstract:
- lang: eng
  text: Object-oriented specification mechanisms have become famous for modelling
    structure and behaviour together in terms of autonomous objects communicating
    via message passing. However, whereas most object-oriented specification methods
    are strong in modelling the local behaviour of single objects, they fall short
    on modelling the coordinated behaviour and collaboration of several objects together
    The aim of this paper is to contribute to fill this gap. The paper reports on
    concepts, language constructs, and experiences with three collaboration formalisms
    in the area of object-oriented specifications.
author:
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Luuk
  full_name: Groenewegen, Luuk
  last_name: Groenewegen
- first_name: Gerti
  full_name: Kappel, Gerti
  last_name: Kappel
citation:
  ama: 'Engels G, Groenewegen L, Kappel G. Object-oriented specification of coordinated
    collaboration. In: <i>Proceedings of IFIP World Conference on IT Tools (1996),
    Canberra (Australia)</i>. Chapman &#38; Hall; 1996:437-452.'
  apa: Engels, G., Groenewegen, L., &#38; Kappel, G. (1996). Object-oriented specification
    of coordinated collaboration. In <i>Proceedings of IFIP World Conference on IT
    Tools (1996), Canberra (Australia)</i> (pp. 437–452). Chapman &#38; Hall.
  bibtex: '@inproceedings{Engels_Groenewegen_Kappel_1996, title={Object-oriented specification
    of coordinated collaboration}, booktitle={Proceedings of IFIP World Conference
    on IT Tools (1996), Canberra (Australia)}, publisher={Chapman &#38; Hall}, author={Engels,
    Gregor and Groenewegen, Luuk and Kappel, Gerti}, year={1996}, pages={437–452}
    }'
  chicago: Engels, Gregor, Luuk Groenewegen, and Gerti Kappel. “Object-Oriented Specification
    of Coordinated Collaboration.” In <i>Proceedings of IFIP World Conference on IT
    Tools (1996), Canberra (Australia)</i>, 437–52. Chapman &#38; Hall, 1996.
  ieee: G. Engels, L. Groenewegen, and G. Kappel, “Object-oriented specification of
    coordinated collaboration,” in <i>Proceedings of IFIP World Conference on IT Tools
    (1996), Canberra (Australia)</i>, 1996, pp. 437–452.
  mla: Engels, Gregor, et al. “Object-Oriented Specification of Coordinated Collaboration.”
    <i>Proceedings of IFIP World Conference on IT Tools (1996), Canberra (Australia)</i>,
    Chapman &#38; Hall, 1996, pp. 437–52.
  short: 'G. Engels, L. Groenewegen, G. Kappel, in: Proceedings of IFIP World Conference
    on IT Tools (1996), Canberra (Australia), Chapman &#38; Hall, 1996, pp. 437–452.'
date_created: 2019-02-20T14:05:50Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
language:
- iso: eng
page: 437-452
publication: Proceedings of IFIP World Conference on IT Tools (1996), Canberra (Australia)
publisher: Chapman & Hall
status: public
title: Object-oriented specification of coordinated collaboration
type: conference
user_id: '52534'
year: '1996'
...
---
_id: '8197'
abstract:
- lang: eng
  text: The framework of graph transformation combines the potentials and advantages
    of both, graphs and rules, into a single computational paradigm. In this paper
    we survey recent developments in applying graph transformation as a rule-based
    framework for the specification and development of systems, languages, and tools.
    After presenting the basic features of graph transformation, we discuss a spectrum
    of applications including the evaluation of functional expressions, the specification
    of an interactive graphical tool, an example specification for abstract data types,
    and the definition of a visual database query language. The case studies indicate
    the need for a graph transformation language that provides suitable structuring
    principles and is independent of a particular graph transformation approach. To
    this end, we sketch the basic features of the new graph- and rule-centered language
    Grace, currently under development, that permits systematic and structured specification
    and programming based on graph transformation.
author:
- first_name: Marc
  full_name: Andries, Marc
  last_name: Andries
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Annegret
  full_name: Habel, Annegret
  last_name: Habel
- first_name: Berthold
  full_name: Hoffmann, Berthold
  last_name: Hoffmann
- first_name: Hans-Jörg
  full_name: Kreowski, Hans-Jörg
  last_name: Kreowski
- first_name: Sabine
  full_name: Kuske, Sabine
  last_name: Kuske
- first_name: Detlef
  full_name: Plump, Detlef
  last_name: Plump
- first_name: Andy
  full_name: Schürr, Andy
  last_name: Schürr
- first_name: Gabriele
  full_name: Taentzer, Gabriele
  last_name: Taentzer
citation:
  ama: Andries M, Engels G, Habel A, et al. <i>Graph Transformation for Specification
    and Programming</i>. University of Bremen, Department of Mathematics and Computer
    Science; 1996.
  apa: Andries, M., Engels, G., Habel, A., Hoffmann, B., Kreowski, H.-J., Kuske, S.,
    … Taentzer, G. (1996). <i>Graph Transformation for Specification and Programming</i>.
    University of Bremen, Department of Mathematics and Computer Science.
  bibtex: '@book{Andries_Engels_Habel_Hoffmann_Kreowski_Kuske_Plump_Schürr_Taentzer_1996,
    title={Graph Transformation for Specification and Programming}, publisher={University
    of Bremen, Department of Mathematics and Computer Science}, author={Andries, Marc
    and Engels, Gregor and Habel, Annegret and Hoffmann, Berthold and Kreowski, Hans-Jörg
    and Kuske, Sabine and Plump, Detlef and Schürr, Andy and Taentzer, Gabriele},
    year={1996} }'
  chicago: Andries, Marc, Gregor Engels, Annegret Habel, Berthold Hoffmann, Hans-Jörg
    Kreowski, Sabine Kuske, Detlef Plump, Andy Schürr, and Gabriele Taentzer. <i>Graph
    Transformation for Specification and Programming</i>. University of Bremen, Department
    of Mathematics and Computer Science, 1996.
  ieee: M. Andries <i>et al.</i>, <i>Graph Transformation for Specification and Programming</i>.
    University of Bremen, Department of Mathematics and Computer Science, 1996.
  mla: Andries, Marc, et al. <i>Graph Transformation for Specification and Programming</i>.
    University of Bremen, Department of Mathematics and Computer Science, 1996.
  short: M. Andries, G. Engels, A. Habel, B. Hoffmann, H.-J. Kreowski, S. Kuske, D.
    Plump, A. Schürr, G. Taentzer, Graph Transformation for Specification and Programming,
    University of Bremen, Department of Mathematics and Computer Science, 1996.
date_created: 2019-03-03T16:12:53Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '66'
language:
- iso: eng
publisher: University of Bremen, Department of Mathematics and Computer Science
report_number: 7/96
status: public
title: Graph Transformation for Specification and Programming
type: report
user_id: '52534'
year: '1996'
...
---
_id: '8198'
author:
- first_name: Giorgio
  full_name: Busatto, Giorgio
  last_name: Busatto
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Busatto G, Engels G. <i>Definition of an Encapsulated Hierarchical Graph Data
    Model: Static Aspects, Part 1.</i> Vakgroep Informatica, Rijksuniversiteit Leiden;
    1996.'
  apa: 'Busatto, G., &#38; Engels, G. (1996). <i>Definition of an Encapsulated Hierarchical
    Graph Data Model: Static Aspects, Part 1.</i> Vakgroep Informatica, Rijksuniversiteit
    Leiden.'
  bibtex: '@book{Busatto_Engels_1996, title={Definition of an Encapsulated Hierarchical
    Graph Data Model: Static Aspects, Part 1.}, publisher={Vakgroep Informatica, Rijksuniversiteit
    Leiden}, author={Busatto, Giorgio and Engels, Gregor}, year={1996} }'
  chicago: 'Busatto, Giorgio, and Gregor Engels. <i>Definition of an Encapsulated
    Hierarchical Graph Data Model: Static Aspects, Part 1.</i> Vakgroep Informatica,
    Rijksuniversiteit Leiden, 1996.'
  ieee: 'G. Busatto and G. Engels, <i>Definition of an Encapsulated Hierarchical Graph
    Data Model: Static Aspects, Part 1.</i> Vakgroep Informatica, Rijksuniversiteit
    Leiden, 1996.'
  mla: 'Busatto, Giorgio, and Gregor Engels. <i>Definition of an Encapsulated Hierarchical
    Graph Data Model: Static Aspects, Part 1.</i> Vakgroep Informatica, Rijksuniversiteit
    Leiden, 1996.'
  short: 'G. Busatto, G. Engels, Definition of an Encapsulated Hierarchical Graph
    Data Model: Static Aspects, Part 1., Vakgroep Informatica, Rijksuniversiteit Leiden,
    1996.'
date_created: 2019-03-03T16:12:54Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '66'
language:
- iso: eng
publisher: Vakgroep Informatica, Rijksuniversiteit Leiden
report_number: 96-38
status: public
title: 'Definition of an Encapsulated Hierarchical Graph Data Model: Static Aspects,
  Part 1.'
type: report
user_id: '52534'
year: '1996'
...