ReFlex: An Efficient Graph-Based Rule Engine to Execute Declarative Processes
Declarative Business Processes offer more flexibility to business processes by the use of business rules. Such business rules describe what must or must not be done during the process execution, but do not prescribe how. To fully experience the benefits of this modeling approach, companies need a ru...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1384 |
|---|---|
| container_issue | |
| container_start_page | 1379 |
| container_title | |
| container_volume | |
| creator | De Carvalho, Renata M. Silva, Natalia C. Lima, Ricardo M. F. Cornelio, Marcio L. |
| description | Declarative Business Processes offer more flexibility to business processes by the use of business rules. Such business rules describe what must or must not be done during the process execution, but do not prescribe how. To fully experience the benefits of this modeling approach, companies need a rule engine capable of checking the rules and guiding the user through the execution of the process. The rule engines available today present several limitations that impair their use to this application. In particular, the well-known approach that employs Linear Temporal Logic (LTL) has the drawback of the state space explosion as the process model grows. This paper proposes a novel graph-based rule engine that does not share the problems presented by other engines, being better suited to model declarative business processes than the techniques currently in use. |
| doi_str_mv | 10.1109/SMC.2013.238 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6721991</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6721991</ieee_id><sourcerecordid>6721991</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-43079570fa2917779570aa2c1345c911583ed07a11eb0c6e0d29918084a338cc3</originalsourceid><addsrcrecordid>eNotjLFOwzAUAA0CibSwsbH4B1Lee47jmK20aUFqBSogsVXGeQGjkFZxisrfg4DpbjidEOcII0Swlw_LyYgA1YhUcSAGmBlrIddEhyIhbUyKudZHIkHIKbVEzydiEOM7AEGGRSKWK541vL-S41aWdR184LaX885t39JrF7mSq13DsmxfQ8uy38hyz37Xs5yyb1zn-vDJ8r7beI6R46k4rl0T-eyfQ_E0Kx8nN-nibn47GS_SgEb3aabAWG2gdmTRmF93jjyqTHuLqAvFFRiHyC_gc4aKrMUCiswpVXivhuLi7xuYeb3twofrvta5Ifzp1DdXbkv5</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>ReFlex: An Efficient Graph-Based Rule Engine to Execute Declarative Processes</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>De Carvalho, Renata M. ; Silva, Natalia C. ; Lima, Ricardo M. F. ; Cornelio, Marcio L.</creator><creatorcontrib>De Carvalho, Renata M. ; Silva, Natalia C. ; Lima, Ricardo M. F. ; Cornelio, Marcio L.</creatorcontrib><description>Declarative Business Processes offer more flexibility to business processes by the use of business rules. Such business rules describe what must or must not be done during the process execution, but do not prescribe how. To fully experience the benefits of this modeling approach, companies need a rule engine capable of checking the rules and guiding the user through the execution of the process. The rule engines available today present several limitations that impair their use to this application. In particular, the well-known approach that employs Linear Temporal Logic (LTL) has the drawback of the state space explosion as the process model grows. This paper proposes a novel graph-based rule engine that does not share the problems presented by other engines, being better suited to model declarative business processes than the techniques currently in use.</description><identifier>ISSN: 1062-922X</identifier><identifier>EISSN: 2577-1655</identifier><identifier>EISBN: 1479906522</identifier><identifier>EISBN: 9781479906529</identifier><identifier>DOI: 10.1109/SMC.2013.238</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; business process ; business rules ; Companies ; declarative processes ; Engines ; graph theory ; Inference algorithms ; rule engine ; Runtime ; System recovery</subject><ispartof>2013 IEEE International Conference on Systems, Man, and Cybernetics, 2013, p.1379-1384</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6721991$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,27916,54911</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6721991$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>De Carvalho, Renata M.</creatorcontrib><creatorcontrib>Silva, Natalia C.</creatorcontrib><creatorcontrib>Lima, Ricardo M. F.</creatorcontrib><creatorcontrib>Cornelio, Marcio L.</creatorcontrib><title>ReFlex: An Efficient Graph-Based Rule Engine to Execute Declarative Processes</title><title>2013 IEEE International Conference on Systems, Man, and Cybernetics</title><addtitle>smc</addtitle><description>Declarative Business Processes offer more flexibility to business processes by the use of business rules. Such business rules describe what must or must not be done during the process execution, but do not prescribe how. To fully experience the benefits of this modeling approach, companies need a rule engine capable of checking the rules and guiding the user through the execution of the process. The rule engines available today present several limitations that impair their use to this application. In particular, the well-known approach that employs Linear Temporal Logic (LTL) has the drawback of the state space explosion as the process model grows. This paper proposes a novel graph-based rule engine that does not share the problems presented by other engines, being better suited to model declarative business processes than the techniques currently in use.</description><subject>Algorithm design and analysis</subject><subject>business process</subject><subject>business rules</subject><subject>Companies</subject><subject>declarative processes</subject><subject>Engines</subject><subject>graph theory</subject><subject>Inference algorithms</subject><subject>rule engine</subject><subject>Runtime</subject><subject>System recovery</subject><issn>1062-922X</issn><issn>2577-1655</issn><isbn>1479906522</isbn><isbn>9781479906529</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2013</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjLFOwzAUAA0CibSwsbH4B1Lee47jmK20aUFqBSogsVXGeQGjkFZxisrfg4DpbjidEOcII0Swlw_LyYgA1YhUcSAGmBlrIddEhyIhbUyKudZHIkHIKbVEzydiEOM7AEGGRSKWK541vL-S41aWdR184LaX885t39JrF7mSq13DsmxfQ8uy38hyz37Xs5yyb1zn-vDJ8r7beI6R46k4rl0T-eyfQ_E0Kx8nN-nibn47GS_SgEb3aabAWG2gdmTRmF93jjyqTHuLqAvFFRiHyC_gc4aKrMUCiswpVXivhuLi7xuYeb3twofrvta5Ifzp1DdXbkv5</recordid><startdate>201310</startdate><enddate>201310</enddate><creator>De Carvalho, Renata M.</creator><creator>Silva, Natalia C.</creator><creator>Lima, Ricardo M. F.</creator><creator>Cornelio, Marcio L.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201310</creationdate><title>ReFlex: An Efficient Graph-Based Rule Engine to Execute Declarative Processes</title><author>De Carvalho, Renata M. ; Silva, Natalia C. ; Lima, Ricardo M. F. ; Cornelio, Marcio L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-43079570fa2917779570aa2c1345c911583ed07a11eb0c6e0d29918084a338cc3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithm design and analysis</topic><topic>business process</topic><topic>business rules</topic><topic>Companies</topic><topic>declarative processes</topic><topic>Engines</topic><topic>graph theory</topic><topic>Inference algorithms</topic><topic>rule engine</topic><topic>Runtime</topic><topic>System recovery</topic><toplevel>online_resources</toplevel><creatorcontrib>De Carvalho, Renata M.</creatorcontrib><creatorcontrib>Silva, Natalia C.</creatorcontrib><creatorcontrib>Lima, Ricardo M. F.</creatorcontrib><creatorcontrib>Cornelio, Marcio L.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEL</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>De Carvalho, Renata M.</au><au>Silva, Natalia C.</au><au>Lima, Ricardo M. F.</au><au>Cornelio, Marcio L.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>ReFlex: An Efficient Graph-Based Rule Engine to Execute Declarative Processes</atitle><btitle>2013 IEEE International Conference on Systems, Man, and Cybernetics</btitle><stitle>smc</stitle><date>2013-10</date><risdate>2013</risdate><spage>1379</spage><epage>1384</epage><pages>1379-1384</pages><issn>1062-922X</issn><eissn>2577-1655</eissn><eisbn>1479906522</eisbn><eisbn>9781479906529</eisbn><coden>IEEPAD</coden><abstract>Declarative Business Processes offer more flexibility to business processes by the use of business rules. Such business rules describe what must or must not be done during the process execution, but do not prescribe how. To fully experience the benefits of this modeling approach, companies need a rule engine capable of checking the rules and guiding the user through the execution of the process. The rule engines available today present several limitations that impair their use to this application. In particular, the well-known approach that employs Linear Temporal Logic (LTL) has the drawback of the state space explosion as the process model grows. This paper proposes a novel graph-based rule engine that does not share the problems presented by other engines, being better suited to model declarative business processes than the techniques currently in use.</abstract><pub>IEEE</pub><doi>10.1109/SMC.2013.238</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1062-922X |
| ispartof | 2013 IEEE International Conference on Systems, Man, and Cybernetics, 2013, p.1379-1384 |
| issn | 1062-922X 2577-1655 |
| language | eng |
| recordid | cdi_ieee_primary_6721991 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis business process business rules Companies declarative processes Engines graph theory Inference algorithms rule engine Runtime System recovery |
| title | ReFlex: An Efficient Graph-Based Rule Engine to Execute Declarative Processes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T17%3A40%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=ReFlex:%20An%20Efficient%20Graph-Based%20Rule%20Engine%20to%20Execute%20Declarative%20Processes&rft.btitle=2013%20IEEE%20International%20Conference%20on%20Systems,%20Man,%20and%20Cybernetics&rft.au=De%20Carvalho,%20Renata%20M.&rft.date=2013-10&rft.spage=1379&rft.epage=1384&rft.pages=1379-1384&rft.issn=1062-922X&rft.eissn=2577-1655&rft.coden=IEEPAD&rft_id=info:doi/10.1109/SMC.2013.238&rft_dat=%3Cieee_6IE%3E6721991%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1479906522&rft.eisbn_list=9781479906529&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6721991&rfr_iscdi=true |