An Incremental Approach to Analyzing Temporal Constraints of Workflow Processes View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2012

AUTHORS

Yanhua Du , Xitong Li

ABSTRACT

The current fast-changing business environment requires workflow management systems to provide the ability of incremental analysis when process models are edited or updated. There are few researches on the dynamic verification of temporal constraints in an incremental way. In this paper, we present an approach to incremental analysis of temporal constraints. Firstly, after each operation performed by designers, the old change regions before the operation and the new change regions after the operation are generated by comparing the old and new Time Workflow nets (TWF-nets) of processes. Secondly, the sprouting graph recording time and path information of old TWF-net is maintained efficiently to the new state, instead of re-constructing a new sprouting graph. Finally, temporal violations are checked and the paths with violations are reported to designers. This approach is particularly applicable and efficient in terms of time and space for large-scale and complex processes. More... »

PAGES

170-182

References to SciGraph publications

  • 1999-06-11. Time Constraints in Workflow Systems in ACTIVE FLOW AND COMBUSTION CONTROL 2018
  • 2005. Temporal Dependency for Dynamic Verification of Fixed-Date Constraints in Grid Workflow Systems in WEB TECHNOLOGIES RESEARCH AND DEVELOPMENT - APWEB 2005
  • Book

    TITLE

    Web Technologies and Applications

    ISBN

    978-3-642-29252-1
    978-3-642-29253-8

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/978-3-642-29253-8_15

    DOI

    http://dx.doi.org/10.1007/978-3-642-29253-8_15

    DIMENSIONS

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


    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/0806", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information Systems", 
            "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 Science and Technology Beijing", 
              "id": "https://www.grid.ac/institutes/grid.69775.3a", 
              "name": [
                "School of Mechanical Engineering, University of Science and Technology, Beijing, 100083, China"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Du", 
            "givenName": "Yanhua", 
            "id": "sg:person.016174301343.46", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016174301343.46"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Massachusetts Institute of Technology", 
              "id": "https://www.grid.ac/institutes/grid.116068.8", 
              "name": [
                "Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA\u00a002142, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Li", 
            "givenName": "Xitong", 
            "id": "sg:person.014554510542.48", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014554510542.48"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1016/j.elerap.2004.09.003", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002098049"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-31849-1_78", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012745970", 
              "https://doi.org/10.1007/978-3-540-31849-1_78"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-31849-1_78", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012745970", 
              "https://doi.org/10.1007/978-3-540-31849-1_78"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0304-3975(00)00321-2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1013559429"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.infsof.2008.02.004", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1036650313"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48738-7_22", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046834329", 
              "https://doi.org/10.1007/3-540-48738-7_22"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-48738-7_22", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1046834329", 
              "https://doi.org/10.1007/3-540-48738-7_22"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/224019.224021", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1049353387"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/3477.775271", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061158356"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/tsmca.2011.2116003", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061795740"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/tsmcc.2008.919178", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061798118"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/apsec.2004.47", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094122256"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2012", 
        "datePublishedReg": "2012-01-01", 
        "description": "The current fast-changing business environment requires workflow management systems to provide the ability of incremental analysis when process models are edited or updated. There are few researches on the dynamic verification of temporal constraints in an incremental way. In this paper, we present an approach to incremental analysis of temporal constraints. Firstly, after each operation performed by designers, the old change regions before the operation and the new change regions after the operation are generated by comparing the old and new Time Workflow nets (TWF-nets) of processes. Secondly, the sprouting graph recording time and path information of old TWF-net is maintained efficiently to the new state, instead of re-constructing a new sprouting graph. Finally, temporal violations are checked and the paths with violations are reported to designers. This approach is particularly applicable and efficient in terms of time and space for large-scale and complex processes.", 
        "editor": [
          {
            "familyName": "Sheng", 
            "givenName": "Quan Z.", 
            "type": "Person"
          }, 
          {
            "familyName": "Wang", 
            "givenName": "Guoren", 
            "type": "Person"
          }, 
          {
            "familyName": "Jensen", 
            "givenName": "Christian S.", 
            "type": "Person"
          }, 
          {
            "familyName": "Xu", 
            "givenName": "Guandong", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/978-3-642-29253-8_15", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": {
          "isbn": [
            "978-3-642-29252-1", 
            "978-3-642-29253-8"
          ], 
          "name": "Web Technologies and Applications", 
          "type": "Book"
        }, 
        "name": "An Incremental Approach to Analyzing Temporal Constraints of Workflow Processes", 
        "pagination": "170-182", 
        "productId": [
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/978-3-642-29253-8_15"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "c27e26756a2e8f068e01137c25a4a72e5fc4d449bc0055feafb14885b8fc83a0"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1040828799"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/978-3-642-29253-8_15", 
          "https://app.dimensions.ai/details/publication/pub.1040828799"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-15T21:03", 
        "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_8690_00000268.jsonl", 
        "type": "Chapter", 
        "url": "http://link.springer.com/10.1007/978-3-642-29253-8_15"
      }
    ]
     

    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/978-3-642-29253-8_15'

    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/978-3-642-29253-8_15'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-29253-8_15'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-29253-8_15'


     

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

    122 TRIPLES      23 PREDICATES      37 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/978-3-642-29253-8_15 schema:about anzsrc-for:08
    2 anzsrc-for:0806
    3 schema:author N94c3421b52d1419b96af44e2f2a1885a
    4 schema:citation sg:pub.10.1007/3-540-48738-7_22
    5 sg:pub.10.1007/978-3-540-31849-1_78
    6 https://doi.org/10.1016/j.elerap.2004.09.003
    7 https://doi.org/10.1016/j.infsof.2008.02.004
    8 https://doi.org/10.1016/s0304-3975(00)00321-2
    9 https://doi.org/10.1109/3477.775271
    10 https://doi.org/10.1109/apsec.2004.47
    11 https://doi.org/10.1109/tsmca.2011.2116003
    12 https://doi.org/10.1109/tsmcc.2008.919178
    13 https://doi.org/10.1145/224019.224021
    14 schema:datePublished 2012
    15 schema:datePublishedReg 2012-01-01
    16 schema:description The current fast-changing business environment requires workflow management systems to provide the ability of incremental analysis when process models are edited or updated. There are few researches on the dynamic verification of temporal constraints in an incremental way. In this paper, we present an approach to incremental analysis of temporal constraints. Firstly, after each operation performed by designers, the old change regions before the operation and the new change regions after the operation are generated by comparing the old and new Time Workflow nets (TWF-nets) of processes. Secondly, the sprouting graph recording time and path information of old TWF-net is maintained efficiently to the new state, instead of re-constructing a new sprouting graph. Finally, temporal violations are checked and the paths with violations are reported to designers. This approach is particularly applicable and efficient in terms of time and space for large-scale and complex processes.
    17 schema:editor Ne6f3ed810cbe49d28c09220056315283
    18 schema:genre chapter
    19 schema:inLanguage en
    20 schema:isAccessibleForFree false
    21 schema:isPartOf N9e8ce7fcf37049159357a075001516c7
    22 schema:name An Incremental Approach to Analyzing Temporal Constraints of Workflow Processes
    23 schema:pagination 170-182
    24 schema:productId N06b56c951b52486c9241955d03c5bb58
    25 N79e9a870c2b247c6b93f54ca4fed521f
    26 Ndc0fef4fa1ff464d810457708d5cb716
    27 schema:publisher N146ec1424cdf4e329df82a5d7e4f142b
    28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1040828799
    29 https://doi.org/10.1007/978-3-642-29253-8_15
    30 schema:sdDatePublished 2019-04-15T21:03
    31 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    32 schema:sdPublisher N8d6655656aed40f1b4353bbc5bd2845c
    33 schema:url http://link.springer.com/10.1007/978-3-642-29253-8_15
    34 sgo:license sg:explorer/license/
    35 sgo:sdDataset chapters
    36 rdf:type schema:Chapter
    37 N06b56c951b52486c9241955d03c5bb58 schema:name doi
    38 schema:value 10.1007/978-3-642-29253-8_15
    39 rdf:type schema:PropertyValue
    40 N146ec1424cdf4e329df82a5d7e4f142b schema:location Berlin, Heidelberg
    41 schema:name Springer Berlin Heidelberg
    42 rdf:type schema:Organisation
    43 N4964b68f8b3b4235ab0316ead66487f2 schema:familyName Sheng
    44 schema:givenName Quan Z.
    45 rdf:type schema:Person
    46 N79432fe86c994cc1b91758fcfff8f8d2 rdf:first sg:person.014554510542.48
    47 rdf:rest rdf:nil
    48 N79e9a870c2b247c6b93f54ca4fed521f schema:name dimensions_id
    49 schema:value pub.1040828799
    50 rdf:type schema:PropertyValue
    51 N8d6655656aed40f1b4353bbc5bd2845c schema:name Springer Nature - SN SciGraph project
    52 rdf:type schema:Organization
    53 N94c3421b52d1419b96af44e2f2a1885a rdf:first sg:person.016174301343.46
    54 rdf:rest N79432fe86c994cc1b91758fcfff8f8d2
    55 N9e8ce7fcf37049159357a075001516c7 schema:isbn 978-3-642-29252-1
    56 978-3-642-29253-8
    57 schema:name Web Technologies and Applications
    58 rdf:type schema:Book
    59 Nb5390a0e25f84732a20f574de39ef208 rdf:first Nb89096d133ec4cc38849364d9d85cb94
    60 rdf:rest Nf44c639bf8314f9393c4cb6b115461d9
    61 Nb89096d133ec4cc38849364d9d85cb94 schema:familyName Wang
    62 schema:givenName Guoren
    63 rdf:type schema:Person
    64 Nca779b5745ed4529b1ec336592d320b8 schema:familyName Xu
    65 schema:givenName Guandong
    66 rdf:type schema:Person
    67 Nd03b44f20b084a34986118221b9b0f9d schema:familyName Jensen
    68 schema:givenName Christian S.
    69 rdf:type schema:Person
    70 Ndc0fef4fa1ff464d810457708d5cb716 schema:name readcube_id
    71 schema:value c27e26756a2e8f068e01137c25a4a72e5fc4d449bc0055feafb14885b8fc83a0
    72 rdf:type schema:PropertyValue
    73 Ne6f3ed810cbe49d28c09220056315283 rdf:first N4964b68f8b3b4235ab0316ead66487f2
    74 rdf:rest Nb5390a0e25f84732a20f574de39ef208
    75 Nf2db4862aa3a460bbec50629001a124f rdf:first Nca779b5745ed4529b1ec336592d320b8
    76 rdf:rest rdf:nil
    77 Nf44c639bf8314f9393c4cb6b115461d9 rdf:first Nd03b44f20b084a34986118221b9b0f9d
    78 rdf:rest Nf2db4862aa3a460bbec50629001a124f
    79 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    80 schema:name Information and Computing Sciences
    81 rdf:type schema:DefinedTerm
    82 anzsrc-for:0806 schema:inDefinedTermSet anzsrc-for:
    83 schema:name Information Systems
    84 rdf:type schema:DefinedTerm
    85 sg:person.014554510542.48 schema:affiliation https://www.grid.ac/institutes/grid.116068.8
    86 schema:familyName Li
    87 schema:givenName Xitong
    88 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014554510542.48
    89 rdf:type schema:Person
    90 sg:person.016174301343.46 schema:affiliation https://www.grid.ac/institutes/grid.69775.3a
    91 schema:familyName Du
    92 schema:givenName Yanhua
    93 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016174301343.46
    94 rdf:type schema:Person
    95 sg:pub.10.1007/3-540-48738-7_22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046834329
    96 https://doi.org/10.1007/3-540-48738-7_22
    97 rdf:type schema:CreativeWork
    98 sg:pub.10.1007/978-3-540-31849-1_78 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012745970
    99 https://doi.org/10.1007/978-3-540-31849-1_78
    100 rdf:type schema:CreativeWork
    101 https://doi.org/10.1016/j.elerap.2004.09.003 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002098049
    102 rdf:type schema:CreativeWork
    103 https://doi.org/10.1016/j.infsof.2008.02.004 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036650313
    104 rdf:type schema:CreativeWork
    105 https://doi.org/10.1016/s0304-3975(00)00321-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013559429
    106 rdf:type schema:CreativeWork
    107 https://doi.org/10.1109/3477.775271 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061158356
    108 rdf:type schema:CreativeWork
    109 https://doi.org/10.1109/apsec.2004.47 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094122256
    110 rdf:type schema:CreativeWork
    111 https://doi.org/10.1109/tsmca.2011.2116003 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061795740
    112 rdf:type schema:CreativeWork
    113 https://doi.org/10.1109/tsmcc.2008.919178 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061798118
    114 rdf:type schema:CreativeWork
    115 https://doi.org/10.1145/224019.224021 schema:sameAs https://app.dimensions.ai/details/publication/pub.1049353387
    116 rdf:type schema:CreativeWork
    117 https://www.grid.ac/institutes/grid.116068.8 schema:alternateName Massachusetts Institute of Technology
    118 schema:name Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA 02142, USA
    119 rdf:type schema:Organization
    120 https://www.grid.ac/institutes/grid.69775.3a schema:alternateName University of Science and Technology Beijing
    121 schema:name School of Mechanical Engineering, University of Science and Technology, Beijing, 100083, China
    122 rdf:type schema:Organization
     




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


    ...