Representing Business Processes Through a Temporal Data-Centric Workflow Modeling Language: An Application to the Management of Clinical Pathways

Combi, Carlo; Gambini, Mauro; Migliorini, Sara; Posenato, Roberto

doi:10.1109/tsmc.2014.2300055

Cited by 45 publications

(31 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the figure, the transitions controlled by Agnes are shown as dashed. 9 A run of this TGA begins at the initial location vera. Whenever Agnes wants to execute one or more time-points, she takes the gain transition to the agnes location, executes her desired time-points, and then immediately returns to vera.…”

Section: Definition 7 (Timed Game Automaton [16]) a Timed Game Autommentioning

confidence: 99%

“…An urgent location, L, can be implemented using a dedicated clock, c, that is reset to zero upon entering L, and by adding the guard, c ≤ 0, to each transition leaving L. 9 Agnes is given control over the uncontrollable transitions, while Vera is given the controllable transitions. This swapping of the traditional roles is necessary to properly capture the execution semantics for STNUs [15].…”

Section: Dc-checking Algorithms For More Expressive Temporal Netmentioning

confidence: 99%

“…1 Although STNUs have been successful in some domains, many domains require a richer set of constraints. For example, in the health-care domain, where workflow management systems are being developed to automate medical-treatment processes, medical tests for any given patient frequently generate information in real time that can affect which pathway that patient will follow [9]. The system must guarantee that any possible execution of the workflow strictly satisfies all specified temporal constraints no matter which test outcomes are observed.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation

Cimatti

Hunsberger

Micheli

et al. 2014

2014 21st International Symposium on Temporal Representation and Reasoning

Self Cite

View full text Add to dashboard Cite

Temporal networks are data structures for representing and reasoning about temporal constraints on activities. Many kinds of temporal networks have been defined in the literature, differing in their expressiveness. The simplest kinds of networks have polynomial algorithms for determining their consistency or controllability, but corresponding algorithms for more expressive networks (e.g., those that include observation nodes or disjunctive constraints) have so far been unavailable. However, recent work has introduced a new approach to such algorithms based on translating temporal networks into Timed Game Automata (TGAs) and then using off-the-shelf software to synthesize execution strategies-or determine that none exist. So far, that approach has only been used on Simple Temporal Networks with Uncertainty, for which polynomial algorithms already exist. This paper extends the temporal-network-to-TGA approach to accommodate observation nodes and disjunctive constraints. Insodoing the paper presents, for the first time, sound and complete algorithms for checking the dynamic controllability of these more expressive networks. The translations also highlight the theoretical relationships between various kinds of temporal networks and the TGA model. The new algorithms have immediate applications in the workflow models being developed to automate business processes, including in the health-care domain.

show abstract

Section: Definition 7 (Timed Game Automaton [16]) a Timed Game Autommentioning

confidence: 99%

Section: Dc-checking Algorithms For More Expressive Temporal Netmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation

Cimatti

Hunsberger

Micheli

et al. 2014

2014 21st International Symposium on Temporal Representation and Reasoning

Self Cite

View full text Add to dashboard Cite

show abstract

“…In addition, when and how to perform the interventions are also undefined, which hinders the electronic implementation of clinical guidelines in practical healthcare settings [18]. Recent studies have reported the effectiveness of CPs and have identified CPs as standard care processes to support the implementation of clinical guidelines and protocols [19][20][21][22]. Taken together, these studies indicate that electronic pathways are of increasing significance due to the construction of digital hospitals and concerns regarding medical quality.…”

Section: Introductionmentioning

confidence: 99%

Research and Development of Semantics-based Sharable Clinical Pathway Systems

et al. 2015

View full text Add to dashboard Cite

The clinical pathway (CP) as a novel medical management schema is beneficial for reducing the length of stay, decreasing heath care costs, standardizing clinical activities, and improving medical quality. However, the practicability of CPs is limited by the complexity and expense of adding the standard functions of electronic CPs to existing electronic medical record (EMR) systems. The purpose of this study was to design and develop an independent clinical pathway (ICP) system that is sharable with different EMR systems. An innovative knowledge base pattern was designed with separate namespaces for global knowledge, local knowledge, and real-time instances. Semantic web technologies were introduced to support knowledge sharing and intelligent reasoning. The proposed system, which was developed in a Java integrated development environment, achieved standard functions of electronic CPs without modifying existing EMR systems and integration environments in hospitals. The interaction solution between the pathway system and the EMR system simplifies the integration procedures with other hospital information systems. Five categories of transmission information were summarized to ensure the interaction process. Detailed procedures for the application of CPs to patients and managing exceptional alerts are presented by explicit data flow analysis. Compared to embedded pathway systems, independent pathway systems feature greater feasibility and practicability and are more advantageous for achieving the normalized management of standard CPs.

show abstract

“…tive temporal aspects is of crucial importance [4,10,11,20,37,43]. Examples of possible quantitative temporal aspects are: constraints on the earliest start time and latest end time of activities, constraints over the minimum and maximum temporal distance between activities, etc.…”

mentioning

confidence: 99%

A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games

Comin

Posenato

Rizzi

2014

2014 21st International Symposium on Temporal Representation and Reasoning

Self Cite

View full text Add to dashboard Cite

Simple Temporal Networks (STNs) are used in many applications, as they provide a powerful and general tool for representing conjunctions of maximum delay constraints over ordered pairs of temporal variables. We introduce Hyper Temporal Networks (HyTNs), a strict generalization of STNs, to overcome the limitation of considering only conjunctions of constraints. In a Hyper Temporal Network a single temporal constraint may be defined as a set of two or more maximum delay constraints which is satisfied when at least one of these delay constraints is satisfied. As in STNs, a HyTN is consistent when a real value can be assigned to each temporal variable satisfying all the constraints. We show the computational complexity for this generalization and propose effective reduction algorithms for checking consistency of HyTNs unveiling the link with the field of Mean Payoff Games. HyTNs are meant as a light generalization of STNs offering an interesting compromise. On one side, as we show, there exist practical pseudo-polynomial time algorithms for checking consistency and computing feasible schedules for HyTNs. On the other side, HyTNs allow to express natural constraints that cannot be expressed by STNs like "trigger off an event exactly δ min after the occurrence of the last event in a set".

show abstract

Representing Business Processes Through a Temporal Data-Centric Workflow Modeling Language: An Application to the Management of Clinical Pathways

Cited by 45 publications

References 28 publications

Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation

Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation

Research and Development of Semantics-based Sharable Clinical Pathway Systems

A Tractable Generalization of Simple Temporal Networks and Its Relation to Mean Payoff Games

Contact Info

Product

Resources

About