Negotiation as concurrency primitive View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2019-03

AUTHORS

Jörg Desel, Javier Esparza, Philipp Hoffmann

ABSTRACT

This paper introduces negotiations, a model of concurrency close to Petri nets, with multi-party negotiations as concurrency primitive. We study two fundamental analysis problems. The soundness problem consists in deciding if it is always possible for a negotiation to terminate successfully, whatever the current state is. Given a sound negotiation, the summarization problem aims at computing an equivalent one-step negotiation with the same input/output behavior. The soundness and summarization problems can be solved by means of simple algorithms acting on the state space of the negotiation, which however face the well-known state explosion problem. We study alternative algorithms that avoid the construction of the state space. In particular, we define reduction rules that simplify a negotiation while preserving the sound/non-sound character of the negotiation and its summary. In a first result we show that our rules are complete for the class of weakly deterministic acyclic negotiations, meaning that they reduce all sound negotiations in this class, and only them, to equivalent one-step negotiations. This provides algorithms for both the soundness and the summarization problem that avoid the construction of the state space. We then study the class of deterministic negotiations. Our second main result shows that the rules are also complete for this class, even if the negotiations contain cycles. Moreover, we present an algorithm that completely reduces all sound deterministic negotiations, and only them, in polynomial time. More... »

PAGES

93-159

References to SciGraph publications

  • 2009. A Petri-Net-Based Modeling Framework for Automated Negotiation Protocols in Electronic Commerce in MULTI-AGENT SYSTEMS FOR SOCIETY
  • 2016. Polynomial Analysis Algorithms for Free Choice Probabilistic Workflow Nets in QUANTITATIVE EVALUATION OF SYSTEMS
  • 2016. Reduction Rules for Colored Workflow Nets in FUNDAMENTAL APPROACHES TO SOFTWARE ENGINEERING
  • 2016. Diagnostic Information for Control-Flow Analysis of Workflow Graphs (a.k.a. Free-Choice Workflow Nets) in TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS
  • 1992. Struktur und Analyse von Free-Choice-Petrinetzen in NONE
  • 2001-03. Automated Negotiation: Prospects, Methods and Challenges in GROUP DECISION AND NEGOTIATION
  • 2014. On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations in FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES
  • 1990. A reduction theory for coloured nets in ADVANCES IN PETRI NETS 1989
  • 2004. Negotiation Among Web Services Using LOTOS/CADP in WEB SERVICES
  • 2016. Negotiations and Petri Nets in TRANSACTIONS ON PETRI NETS AND OTHER MODELS OF CONCURRENCY XI
  • 2013. On Negotiation as Concurrency Primitive in CONCUR 2013 – CONCURRENCY THEORY
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s00236-018-0318-9

    DOI

    http://dx.doi.org/10.1007/s00236-018-0318-9

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1101632367


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Computation Theory and Mathematics", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "University of Hagen", 
              "id": "https://www.grid.ac/institutes/grid.31730.36", 
              "name": [
                "FernUniversit\u00e4t in Hagen, Hagen, Germany"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Desel", 
            "givenName": "J\u00f6rg", 
            "id": "sg:person.015317545245.50", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015317545245.50"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Technical University Munich", 
              "id": "https://www.grid.ac/institutes/grid.6936.a", 
              "name": [
                "Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Esparza", 
            "givenName": "Javier", 
            "id": "sg:person.014645154544.15", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014645154544.15"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Technical University Munich", 
              "id": "https://www.grid.ac/institutes/grid.6936.a", 
              "name": [
                "Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Hoffmann", 
            "givenName": "Philipp", 
            "id": "sg:person.07775371753.46", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07775371753.46"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-540-30209-4_15", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000388891", 
              "https://doi.org/10.1007/978-3-540-30209-4_15"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-30209-4_15", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000388891", 
              "https://doi.org/10.1007/978-3-540-30209-4_15"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-52494-0_31", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1001469251", 
              "https://doi.org/10.1007/3-540-52494-0_31"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-40184-8_31", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1006853894", 
              "https://doi.org/10.1007/978-3-642-40184-8_31"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-03339-1_26", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010225493", 
              "https://doi.org/10.1007/978-3-642-03339-1_26"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-03339-1_26", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010225493", 
              "https://doi.org/10.1007/978-3-642-03339-1_26"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0304-3975(84)90137-3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012191737"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-43425-4_6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1013520040", 
              "https://doi.org/10.1007/978-3-319-43425-4_6"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0004-3702(83)90015-2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1016185709"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0004-3702(83)90015-2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1016185709"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-662-49674-9_27", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1022398920", 
              "https://doi.org/10.1007/978-3-662-49674-9_27"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-662-49665-7_20", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1022696524", 
              "https://doi.org/10.1007/978-3-662-49665-7_20"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-54830-7_17", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1028122445", 
              "https://doi.org/10.1007/978-3-642-54830-7_17"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1023/a:1008746126376", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1029777010", 
              "https://doi.org/10.1023/a:1008746126376"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-662-53401-4_10", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1043004299", 
              "https://doi.org/10.1007/978-3-662-53401-4_10"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-663-14543-1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046281450", 
              "https://doi.org/10.1007/978-3-663-14543-1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-663-14543-1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046281450", 
              "https://doi.org/10.1007/978-3-663-14543-1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.jcss.2009.06.003", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1052662049"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/12.895935", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061089285"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1142/s0129626406002502", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062907308"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1142/s0218126698000043", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062953219"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1142/s0218843011002237", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062983750"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/lics.2017.8005144", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1093865356"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/mmar.2012.6347878", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095720956"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1017/cbo9780511526558", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1098786518"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2019-03", 
        "datePublishedReg": "2019-03-01", 
        "description": "This paper introduces negotiations, a model of concurrency close to Petri nets, with multi-party negotiations as concurrency primitive. We study two fundamental analysis problems. The soundness problem consists in deciding if it is always possible for a negotiation to terminate successfully, whatever the current state is. Given a sound negotiation, the summarization problem aims at computing an equivalent one-step negotiation with the same input/output behavior. The soundness and summarization problems can be solved by means of simple algorithms acting on the state space of the negotiation, which however face the well-known state explosion problem. We study alternative algorithms that avoid the construction of the state space. In particular, we define reduction rules that simplify a negotiation while preserving the sound/non-sound character of the negotiation and its summary. In a first result we show that our rules are complete for the class of weakly deterministic acyclic negotiations, meaning that they reduce all sound negotiations in this class, and only them, to equivalent one-step negotiations. This provides algorithms for both the soundness and the summarization problem that avoid the construction of the state space. We then study the class of deterministic negotiations. Our second main result shows that the rules are also complete for this class, even if the negotiations contain cycles. Moreover, we present an algorithm that completely reduces all sound deterministic negotiations, and only them, in polynomial time.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1007/s00236-018-0318-9", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isFundedItemOf": [
          {
            "id": "sg:grant.4831928", 
            "type": "MonetaryGrant"
          }
        ], 
        "isPartOf": [
          {
            "id": "sg:journal.1133515", 
            "issn": [
              "0001-5903", 
              "1432-0525"
            ], 
            "name": "Acta Informatica", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "2", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "56"
          }
        ], 
        "name": "Negotiation as concurrency primitive", 
        "pagination": "93-159", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "68d5158555ccc21a5c11cc23558a58ec67a806126edb29f31a1e89b3e55a813b"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s00236-018-0318-9"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1101632367"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s00236-018-0318-9", 
          "https://app.dimensions.ai/details/publication/pub.1101632367"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-11T12:26", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000362_0000000362/records_87112_00000001.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://link.springer.com/10.1007%2Fs00236-018-0318-9"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s00236-018-0318-9'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s00236-018-0318-9'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00236-018-0318-9'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00236-018-0318-9'


     

    This table displays all metadata directly associated to this object as RDF triples.

    154 TRIPLES      21 PREDICATES      48 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s00236-018-0318-9 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author Nae62b90462534d399daa052b15b3b1fb
    4 schema:citation sg:pub.10.1007/3-540-52494-0_31
    5 sg:pub.10.1007/978-3-319-43425-4_6
    6 sg:pub.10.1007/978-3-540-30209-4_15
    7 sg:pub.10.1007/978-3-642-03339-1_26
    8 sg:pub.10.1007/978-3-642-40184-8_31
    9 sg:pub.10.1007/978-3-642-54830-7_17
    10 sg:pub.10.1007/978-3-662-49665-7_20
    11 sg:pub.10.1007/978-3-662-49674-9_27
    12 sg:pub.10.1007/978-3-662-53401-4_10
    13 sg:pub.10.1007/978-3-663-14543-1
    14 sg:pub.10.1023/a:1008746126376
    15 https://doi.org/10.1016/0004-3702(83)90015-2
    16 https://doi.org/10.1016/0304-3975(84)90137-3
    17 https://doi.org/10.1016/j.jcss.2009.06.003
    18 https://doi.org/10.1017/cbo9780511526558
    19 https://doi.org/10.1109/12.895935
    20 https://doi.org/10.1109/lics.2017.8005144
    21 https://doi.org/10.1109/mmar.2012.6347878
    22 https://doi.org/10.1142/s0129626406002502
    23 https://doi.org/10.1142/s0218126698000043
    24 https://doi.org/10.1142/s0218843011002237
    25 schema:datePublished 2019-03
    26 schema:datePublishedReg 2019-03-01
    27 schema:description This paper introduces negotiations, a model of concurrency close to Petri nets, with multi-party negotiations as concurrency primitive. We study two fundamental analysis problems. The soundness problem consists in deciding if it is always possible for a negotiation to terminate successfully, whatever the current state is. Given a sound negotiation, the summarization problem aims at computing an equivalent one-step negotiation with the same input/output behavior. The soundness and summarization problems can be solved by means of simple algorithms acting on the state space of the negotiation, which however face the well-known state explosion problem. We study alternative algorithms that avoid the construction of the state space. In particular, we define reduction rules that simplify a negotiation while preserving the sound/non-sound character of the negotiation and its summary. In a first result we show that our rules are complete for the class of weakly deterministic acyclic negotiations, meaning that they reduce all sound negotiations in this class, and only them, to equivalent one-step negotiations. This provides algorithms for both the soundness and the summarization problem that avoid the construction of the state space. We then study the class of deterministic negotiations. Our second main result shows that the rules are also complete for this class, even if the negotiations contain cycles. Moreover, we present an algorithm that completely reduces all sound deterministic negotiations, and only them, in polynomial time.
    28 schema:genre research_article
    29 schema:inLanguage en
    30 schema:isAccessibleForFree true
    31 schema:isPartOf N5a878472e2a7465c9beb52e453aa5d5f
    32 N8ab1a5a437ea4943b97b174642b41bec
    33 sg:journal.1133515
    34 schema:name Negotiation as concurrency primitive
    35 schema:pagination 93-159
    36 schema:productId N04c11c1793e849a693f27d34455aa903
    37 N818ed8ee36fe4bbb96cc9a626b3c5f2b
    38 Naa812e07422a4e1faa9ef092024b52ea
    39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1101632367
    40 https://doi.org/10.1007/s00236-018-0318-9
    41 schema:sdDatePublished 2019-04-11T12:26
    42 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    43 schema:sdPublisher Nfa5ef4a6103a4d9f9bf5e6cbe27fae36
    44 schema:url https://link.springer.com/10.1007%2Fs00236-018-0318-9
    45 sgo:license sg:explorer/license/
    46 sgo:sdDataset articles
    47 rdf:type schema:ScholarlyArticle
    48 N04c11c1793e849a693f27d34455aa903 schema:name doi
    49 schema:value 10.1007/s00236-018-0318-9
    50 rdf:type schema:PropertyValue
    51 N5a878472e2a7465c9beb52e453aa5d5f schema:issueNumber 2
    52 rdf:type schema:PublicationIssue
    53 N72918585054846359e27e57332c0ca13 rdf:first sg:person.07775371753.46
    54 rdf:rest rdf:nil
    55 N740b0ed6597e4e7aa28f68890d6faa7f rdf:first sg:person.014645154544.15
    56 rdf:rest N72918585054846359e27e57332c0ca13
    57 N818ed8ee36fe4bbb96cc9a626b3c5f2b schema:name dimensions_id
    58 schema:value pub.1101632367
    59 rdf:type schema:PropertyValue
    60 N8ab1a5a437ea4943b97b174642b41bec schema:volumeNumber 56
    61 rdf:type schema:PublicationVolume
    62 Naa812e07422a4e1faa9ef092024b52ea schema:name readcube_id
    63 schema:value 68d5158555ccc21a5c11cc23558a58ec67a806126edb29f31a1e89b3e55a813b
    64 rdf:type schema:PropertyValue
    65 Nae62b90462534d399daa052b15b3b1fb rdf:first sg:person.015317545245.50
    66 rdf:rest N740b0ed6597e4e7aa28f68890d6faa7f
    67 Nfa5ef4a6103a4d9f9bf5e6cbe27fae36 schema:name Springer Nature - SN SciGraph project
    68 rdf:type schema:Organization
    69 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    70 schema:name Information and Computing Sciences
    71 rdf:type schema:DefinedTerm
    72 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    73 schema:name Computation Theory and Mathematics
    74 rdf:type schema:DefinedTerm
    75 sg:grant.4831928 http://pending.schema.org/fundedItem sg:pub.10.1007/s00236-018-0318-9
    76 rdf:type schema:MonetaryGrant
    77 sg:journal.1133515 schema:issn 0001-5903
    78 1432-0525
    79 schema:name Acta Informatica
    80 rdf:type schema:Periodical
    81 sg:person.014645154544.15 schema:affiliation https://www.grid.ac/institutes/grid.6936.a
    82 schema:familyName Esparza
    83 schema:givenName Javier
    84 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014645154544.15
    85 rdf:type schema:Person
    86 sg:person.015317545245.50 schema:affiliation https://www.grid.ac/institutes/grid.31730.36
    87 schema:familyName Desel
    88 schema:givenName Jörg
    89 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015317545245.50
    90 rdf:type schema:Person
    91 sg:person.07775371753.46 schema:affiliation https://www.grid.ac/institutes/grid.6936.a
    92 schema:familyName Hoffmann
    93 schema:givenName Philipp
    94 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07775371753.46
    95 rdf:type schema:Person
    96 sg:pub.10.1007/3-540-52494-0_31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001469251
    97 https://doi.org/10.1007/3-540-52494-0_31
    98 rdf:type schema:CreativeWork
    99 sg:pub.10.1007/978-3-319-43425-4_6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013520040
    100 https://doi.org/10.1007/978-3-319-43425-4_6
    101 rdf:type schema:CreativeWork
    102 sg:pub.10.1007/978-3-540-30209-4_15 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000388891
    103 https://doi.org/10.1007/978-3-540-30209-4_15
    104 rdf:type schema:CreativeWork
    105 sg:pub.10.1007/978-3-642-03339-1_26 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010225493
    106 https://doi.org/10.1007/978-3-642-03339-1_26
    107 rdf:type schema:CreativeWork
    108 sg:pub.10.1007/978-3-642-40184-8_31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1006853894
    109 https://doi.org/10.1007/978-3-642-40184-8_31
    110 rdf:type schema:CreativeWork
    111 sg:pub.10.1007/978-3-642-54830-7_17 schema:sameAs https://app.dimensions.ai/details/publication/pub.1028122445
    112 https://doi.org/10.1007/978-3-642-54830-7_17
    113 rdf:type schema:CreativeWork
    114 sg:pub.10.1007/978-3-662-49665-7_20 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022696524
    115 https://doi.org/10.1007/978-3-662-49665-7_20
    116 rdf:type schema:CreativeWork
    117 sg:pub.10.1007/978-3-662-49674-9_27 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022398920
    118 https://doi.org/10.1007/978-3-662-49674-9_27
    119 rdf:type schema:CreativeWork
    120 sg:pub.10.1007/978-3-662-53401-4_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043004299
    121 https://doi.org/10.1007/978-3-662-53401-4_10
    122 rdf:type schema:CreativeWork
    123 sg:pub.10.1007/978-3-663-14543-1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046281450
    124 https://doi.org/10.1007/978-3-663-14543-1
    125 rdf:type schema:CreativeWork
    126 sg:pub.10.1023/a:1008746126376 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029777010
    127 https://doi.org/10.1023/a:1008746126376
    128 rdf:type schema:CreativeWork
    129 https://doi.org/10.1016/0004-3702(83)90015-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1016185709
    130 rdf:type schema:CreativeWork
    131 https://doi.org/10.1016/0304-3975(84)90137-3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012191737
    132 rdf:type schema:CreativeWork
    133 https://doi.org/10.1016/j.jcss.2009.06.003 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052662049
    134 rdf:type schema:CreativeWork
    135 https://doi.org/10.1017/cbo9780511526558 schema:sameAs https://app.dimensions.ai/details/publication/pub.1098786518
    136 rdf:type schema:CreativeWork
    137 https://doi.org/10.1109/12.895935 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061089285
    138 rdf:type schema:CreativeWork
    139 https://doi.org/10.1109/lics.2017.8005144 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093865356
    140 rdf:type schema:CreativeWork
    141 https://doi.org/10.1109/mmar.2012.6347878 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095720956
    142 rdf:type schema:CreativeWork
    143 https://doi.org/10.1142/s0129626406002502 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062907308
    144 rdf:type schema:CreativeWork
    145 https://doi.org/10.1142/s0218126698000043 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062953219
    146 rdf:type schema:CreativeWork
    147 https://doi.org/10.1142/s0218843011002237 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062983750
    148 rdf:type schema:CreativeWork
    149 https://www.grid.ac/institutes/grid.31730.36 schema:alternateName University of Hagen
    150 schema:name FernUniversität in Hagen, Hagen, Germany
    151 rdf:type schema:Organization
    152 https://www.grid.ac/institutes/grid.6936.a schema:alternateName Technical University Munich
    153 schema:name Technische Universität München, Munich, Germany
    154 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...