Delay-dependent partial order reduction technique for real time systems View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2018-04

AUTHORS

Hanifa Boucheneb, Kamel Barkaoui

ABSTRACT

Almost all partial order reduction techniques proposed for time Petri nets (TPNs in short) are based on the notion of Partially Ordered Sets. The idea is to explore simultaneously, by relaxing some firing order constraints of persistent transitions (An enabled transition is persistent, if it cannot be disabled until its firing.), several equivalent sequences, while computing the convex hull of the abstract states reached by these equivalent sequences. However, unlike timed automata, in the TPN state space abstractions, the union of the abstract states reached by different interleavings of the same set of non conflicting transitions is not necessarily identical to their convex hull. Moreover, the convex hull over-approximation preserves neither the boundedness nor the reachability properties of the TPN. In this context, the main challenge is to establish sufficient conditions over transitions that ensure, in addition to their persistency, identity between the union and the convex hull of the abstract states reachable by their different interleavings. This paper shows how to weaken the sufficient conditions proposed in the literature, by taking into better account the structure, the marking, the static and the dynamic time parameters of the TPN. More... »

PAGES

278-306

References to SciGraph publications

  • 2006. Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets in PETRI NETS AND OTHER MODELS OF CONCURRENCY - ICATPN 2006
  • 2014. Delay-Dependent Partial Order Reduction Technique for Time Petri Nets in FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS
  • 2003-02-28. State Class Constructions for Branching Analysis of Time Petri Nets in TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS
  • 1993. All from one, one for all: on model checking using representatives in COMPUTER AIDED VERIFICATION
  • 2010. Can Stubborn Sets Be Optimal? in APPLICATIONS AND THEORY OF PETRI NETS
  • 2013. On Multi-enabledness in Time Petri Nets in APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY
  • 2002-04-19. Partial Order Reduction for Model Checking of Timed Automata in CONCUR’99 CONCURRENCY THEORY
  • 2006. On Interleaving in Timed Automata in CONCUR 2006 – CONCURRENCY THEORY
  • 1998. Partial order reductions for timed systems in CONCUR'98 CONCURRENCY THEORY
  • 2007. Partial Order Reduction for Verification of Real-Time Components in FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS
  • 1997-08. Efficient Verification of Parallel Real–Time Systems in FORMAL METHODS IN SYSTEM DESIGN
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s11241-017-9297-0

    DOI

    http://dx.doi.org/10.1007/s11241-017-9297-0

    DIMENSIONS

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


    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": "Ecole Polytechnique de Montr\u00e9al", 
              "id": "https://www.grid.ac/institutes/grid.183158.6", 
              "name": [
                "Laboratoire VeriForm, Department of Computer Engineering and Software Engineering, \u00c9cole Polytechnique de Montr\u00e9al, 6079, Station Centre-Ville, H3C 3A7, Montr\u00e9al, QC, Canada"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Boucheneb", 
            "givenName": "Hanifa", 
            "id": "sg:person.01151366546.67", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01151366546.67"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Conservatoire National des Arts et M\u00e9tiers", 
              "id": "https://www.grid.ac/institutes/grid.36823.3c", 
              "name": [
                "Laboratoire CEDRIC, Conservatoire National des Arts et M\u00e9tiers, 192 rue Saint Martin, Paris Cedex 03, France"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Barkaoui", 
            "givenName": "Kamel", 
            "id": "sg:person.016140360017.22", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016140360017.22"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1016/s1571-0661(05)80254-3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002087268"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s1571-0661(05)80254-3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002087268"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0055643", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1007924931", 
              "https://doi.org/10.1007/bfb0055643"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-13675-7_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010502474", 
              "https://doi.org/10.1007/978-3-642-13675-7_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-13675-7_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010502474", 
              "https://doi.org/10.1007/978-3-642-13675-7_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11817949_31", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010621345", 
              "https://doi.org/10.1007/11817949_31"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-10512-3_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1013292891", 
              "https://doi.org/10.1007/978-3-319-10512-3_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/2406336.2406343", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1015375230"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-36577-x_33", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020433240", 
              "https://doi.org/10.1007/3-540-36577-x_33"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-36577-x_33", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020433240", 
              "https://doi.org/10.1007/3-540-36577-x_33"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-75454-1_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025011864", 
              "https://doi.org/10.1007/978-3-540-75454-1_16"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-75454-1_16", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025011864", 
              "https://doi.org/10.1007/978-3-540-75454-1_16"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11767589_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025291979", 
              "https://doi.org/10.1007/11767589_8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11767589_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025291979", 
              "https://doi.org/10.1007/11767589_8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48320-9_30", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032040349", 
              "https://doi.org/10.1007/3-540-48320-9_30"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48320-9_30", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032040349", 
              "https://doi.org/10.1007/3-540-48320-9_30"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.tcs.2005.11.002", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1032222905"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1023/a:1008682131325", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033171786", 
              "https://doi.org/10.1023/a:1008682131325"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-56922-7_34", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036741660", 
              "https://doi.org/10.1007/3-540-56922-7_34"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.tcs.2005.07.023", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1038812437"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.tcs.2005.07.023", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1038812437"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0020-0190(97)00133-6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1040028840"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.tcs.2012.12.005", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041086839"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-642-38697-8_8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1041874960", 
              "https://doi.org/10.1007/978-3-642-38697-8_8"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/2680541", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1045970657"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1093/logcom/exp036", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1059876287"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1093/logcom/exp036", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1059876287"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/43.845076", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061174189"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/pnpm.2001.953371", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1093704520"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2018-04", 
        "datePublishedReg": "2018-04-01", 
        "description": "Almost all partial order reduction techniques proposed for time Petri nets (TPNs in short) are based on the notion of Partially Ordered Sets. The idea is to explore simultaneously, by relaxing some firing order constraints of persistent transitions (An enabled transition is persistent, if it cannot be disabled until its firing.), several equivalent sequences, while computing the convex hull of the abstract states reached by these equivalent sequences. However, unlike timed automata, in the TPN state space abstractions, the union of the abstract states reached by different interleavings of the same set of non conflicting transitions is not necessarily identical to their convex hull. Moreover, the convex hull over-approximation preserves neither the boundedness nor the reachability properties of the TPN. In this context, the main challenge is to establish sufficient conditions over transitions that ensure, in addition to their persistency, identity between the union and the convex hull of the abstract states reachable by their different interleavings. This paper shows how to weaken the sufficient conditions proposed in the literature, by taking into better account the structure, the marking, the static and the dynamic time parameters of the TPN.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1007/s11241-017-9297-0", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1136406", 
            "issn": [
              "0922-6443", 
              "1573-1383"
            ], 
            "name": "Real-Time Systems", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "2", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "54"
          }
        ], 
        "name": "Delay-dependent partial order reduction technique for real time systems", 
        "pagination": "278-306", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "cffae4248d6675b880d7cc5e858b9a4030b8c1358bf30c3391a5b5eab8d69d4a"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s11241-017-9297-0"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1099702242"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s11241-017-9297-0", 
          "https://app.dimensions.ai/details/publication/pub.1099702242"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-11T01:01", 
        "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/0000000001_0000000264/records_8697_00000484.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "http://link.springer.com/10.1007/s11241-017-9297-0"
      }
    ]
     

    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/s11241-017-9297-0'

    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/s11241-017-9297-0'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s11241-017-9297-0'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s11241-017-9297-0'


     

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

    145 TRIPLES      21 PREDICATES      48 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s11241-017-9297-0 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author N03a5303daaff4006b1297f3650b08cf2
    4 schema:citation sg:pub.10.1007/11767589_8
    5 sg:pub.10.1007/11817949_31
    6 sg:pub.10.1007/3-540-36577-x_33
    7 sg:pub.10.1007/3-540-48320-9_30
    8 sg:pub.10.1007/3-540-56922-7_34
    9 sg:pub.10.1007/978-3-319-10512-3_5
    10 sg:pub.10.1007/978-3-540-75454-1_16
    11 sg:pub.10.1007/978-3-642-13675-7_5
    12 sg:pub.10.1007/978-3-642-38697-8_8
    13 sg:pub.10.1007/bfb0055643
    14 sg:pub.10.1023/a:1008682131325
    15 https://doi.org/10.1016/j.tcs.2005.07.023
    16 https://doi.org/10.1016/j.tcs.2005.11.002
    17 https://doi.org/10.1016/j.tcs.2012.12.005
    18 https://doi.org/10.1016/s0020-0190(97)00133-6
    19 https://doi.org/10.1016/s1571-0661(05)80254-3
    20 https://doi.org/10.1093/logcom/exp036
    21 https://doi.org/10.1109/43.845076
    22 https://doi.org/10.1109/pnpm.2001.953371
    23 https://doi.org/10.1145/2406336.2406343
    24 https://doi.org/10.1145/2680541
    25 schema:datePublished 2018-04
    26 schema:datePublishedReg 2018-04-01
    27 schema:description Almost all partial order reduction techniques proposed for time Petri nets (TPNs in short) are based on the notion of Partially Ordered Sets. The idea is to explore simultaneously, by relaxing some firing order constraints of persistent transitions (An enabled transition is persistent, if it cannot be disabled until its firing.), several equivalent sequences, while computing the convex hull of the abstract states reached by these equivalent sequences. However, unlike timed automata, in the TPN state space abstractions, the union of the abstract states reached by different interleavings of the same set of non conflicting transitions is not necessarily identical to their convex hull. Moreover, the convex hull over-approximation preserves neither the boundedness nor the reachability properties of the TPN. In this context, the main challenge is to establish sufficient conditions over transitions that ensure, in addition to their persistency, identity between the union and the convex hull of the abstract states reachable by their different interleavings. This paper shows how to weaken the sufficient conditions proposed in the literature, by taking into better account the structure, the marking, the static and the dynamic time parameters of the TPN.
    28 schema:genre research_article
    29 schema:inLanguage en
    30 schema:isAccessibleForFree false
    31 schema:isPartOf N3884951c742e4fac8447bc63b9617f62
    32 Nef1bf4f5d88144fb94d77f6896f51499
    33 sg:journal.1136406
    34 schema:name Delay-dependent partial order reduction technique for real time systems
    35 schema:pagination 278-306
    36 schema:productId N45fb18b10cd0444d97d6983b0f4eb091
    37 Nca68205e818c4f99a3f5874895d19b15
    38 Nfabc094060fb4c4e8da611adad0b4fe2
    39 schema:sameAs https://app.dimensions.ai/details/publication/pub.1099702242
    40 https://doi.org/10.1007/s11241-017-9297-0
    41 schema:sdDatePublished 2019-04-11T01:01
    42 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    43 schema:sdPublisher N0fd42f82273e466baf2aef1c759f8cd1
    44 schema:url http://link.springer.com/10.1007/s11241-017-9297-0
    45 sgo:license sg:explorer/license/
    46 sgo:sdDataset articles
    47 rdf:type schema:ScholarlyArticle
    48 N03a5303daaff4006b1297f3650b08cf2 rdf:first sg:person.01151366546.67
    49 rdf:rest Neab357b566db4828a467105521d065d1
    50 N0fd42f82273e466baf2aef1c759f8cd1 schema:name Springer Nature - SN SciGraph project
    51 rdf:type schema:Organization
    52 N3884951c742e4fac8447bc63b9617f62 schema:issueNumber 2
    53 rdf:type schema:PublicationIssue
    54 N45fb18b10cd0444d97d6983b0f4eb091 schema:name readcube_id
    55 schema:value cffae4248d6675b880d7cc5e858b9a4030b8c1358bf30c3391a5b5eab8d69d4a
    56 rdf:type schema:PropertyValue
    57 Nca68205e818c4f99a3f5874895d19b15 schema:name doi
    58 schema:value 10.1007/s11241-017-9297-0
    59 rdf:type schema:PropertyValue
    60 Neab357b566db4828a467105521d065d1 rdf:first sg:person.016140360017.22
    61 rdf:rest rdf:nil
    62 Nef1bf4f5d88144fb94d77f6896f51499 schema:volumeNumber 54
    63 rdf:type schema:PublicationVolume
    64 Nfabc094060fb4c4e8da611adad0b4fe2 schema:name dimensions_id
    65 schema:value pub.1099702242
    66 rdf:type schema:PropertyValue
    67 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    68 schema:name Information and Computing Sciences
    69 rdf:type schema:DefinedTerm
    70 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    71 schema:name Computation Theory and Mathematics
    72 rdf:type schema:DefinedTerm
    73 sg:journal.1136406 schema:issn 0922-6443
    74 1573-1383
    75 schema:name Real-Time Systems
    76 rdf:type schema:Periodical
    77 sg:person.01151366546.67 schema:affiliation https://www.grid.ac/institutes/grid.183158.6
    78 schema:familyName Boucheneb
    79 schema:givenName Hanifa
    80 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01151366546.67
    81 rdf:type schema:Person
    82 sg:person.016140360017.22 schema:affiliation https://www.grid.ac/institutes/grid.36823.3c
    83 schema:familyName Barkaoui
    84 schema:givenName Kamel
    85 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016140360017.22
    86 rdf:type schema:Person
    87 sg:pub.10.1007/11767589_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025291979
    88 https://doi.org/10.1007/11767589_8
    89 rdf:type schema:CreativeWork
    90 sg:pub.10.1007/11817949_31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010621345
    91 https://doi.org/10.1007/11817949_31
    92 rdf:type schema:CreativeWork
    93 sg:pub.10.1007/3-540-36577-x_33 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020433240
    94 https://doi.org/10.1007/3-540-36577-x_33
    95 rdf:type schema:CreativeWork
    96 sg:pub.10.1007/3-540-48320-9_30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032040349
    97 https://doi.org/10.1007/3-540-48320-9_30
    98 rdf:type schema:CreativeWork
    99 sg:pub.10.1007/3-540-56922-7_34 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036741660
    100 https://doi.org/10.1007/3-540-56922-7_34
    101 rdf:type schema:CreativeWork
    102 sg:pub.10.1007/978-3-319-10512-3_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013292891
    103 https://doi.org/10.1007/978-3-319-10512-3_5
    104 rdf:type schema:CreativeWork
    105 sg:pub.10.1007/978-3-540-75454-1_16 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025011864
    106 https://doi.org/10.1007/978-3-540-75454-1_16
    107 rdf:type schema:CreativeWork
    108 sg:pub.10.1007/978-3-642-13675-7_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010502474
    109 https://doi.org/10.1007/978-3-642-13675-7_5
    110 rdf:type schema:CreativeWork
    111 sg:pub.10.1007/978-3-642-38697-8_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041874960
    112 https://doi.org/10.1007/978-3-642-38697-8_8
    113 rdf:type schema:CreativeWork
    114 sg:pub.10.1007/bfb0055643 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007924931
    115 https://doi.org/10.1007/bfb0055643
    116 rdf:type schema:CreativeWork
    117 sg:pub.10.1023/a:1008682131325 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033171786
    118 https://doi.org/10.1023/a:1008682131325
    119 rdf:type schema:CreativeWork
    120 https://doi.org/10.1016/j.tcs.2005.07.023 schema:sameAs https://app.dimensions.ai/details/publication/pub.1038812437
    121 rdf:type schema:CreativeWork
    122 https://doi.org/10.1016/j.tcs.2005.11.002 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032222905
    123 rdf:type schema:CreativeWork
    124 https://doi.org/10.1016/j.tcs.2012.12.005 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041086839
    125 rdf:type schema:CreativeWork
    126 https://doi.org/10.1016/s0020-0190(97)00133-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040028840
    127 rdf:type schema:CreativeWork
    128 https://doi.org/10.1016/s1571-0661(05)80254-3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002087268
    129 rdf:type schema:CreativeWork
    130 https://doi.org/10.1093/logcom/exp036 schema:sameAs https://app.dimensions.ai/details/publication/pub.1059876287
    131 rdf:type schema:CreativeWork
    132 https://doi.org/10.1109/43.845076 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061174189
    133 rdf:type schema:CreativeWork
    134 https://doi.org/10.1109/pnpm.2001.953371 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093704520
    135 rdf:type schema:CreativeWork
    136 https://doi.org/10.1145/2406336.2406343 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015375230
    137 rdf:type schema:CreativeWork
    138 https://doi.org/10.1145/2680541 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045970657
    139 rdf:type schema:CreativeWork
    140 https://www.grid.ac/institutes/grid.183158.6 schema:alternateName Ecole Polytechnique de Montréal
    141 schema:name Laboratoire VeriForm, Department of Computer Engineering and Software Engineering, École Polytechnique de Montréal, 6079, Station Centre-Ville, H3C 3A7, Montréal, QC, Canada
    142 rdf:type schema:Organization
    143 https://www.grid.ac/institutes/grid.36823.3c schema:alternateName Conservatoire National des Arts et Métiers
    144 schema:name Laboratoire CEDRIC, Conservatoire National des Arts et Métiers, 192 rue Saint Martin, Paris Cedex 03, France
    145 rdf:type schema:Organization
     




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


    ...