Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded platforms where reliability and safety depend to a large extent on the time features. Many of the time dependant models were suggested as real-time extensions of several well-known untimed models. The most studied formalisms include Networks of Timed Automata which extend the model of communicating finite-state machines with a finite number of real-valued clocks, and timed extensions of Petri nets where the added time constructs include e.g. time intervals that are assigned to the transitions (Time Petri Nets) or to the arcs (Timed-Arc Petri Nets). In this paper, we shall semi-formally introduce these models, discuss their strengths and weaknesses, and provide an overview of the known results about the relationships among the models.

/pdf/comparing-the-expressiveness-of-timed-automata-and-timed-3e5fi0arit.pdf

Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets

To gain competitive advantage, hospitals try to streamline their pro- cesses. In order to do so, it is essential to have an accurate view of the "careflows" under consideration. In this paper, we apply process mining techniques to obtain meaningful knowledge about these flows, e.g., to discover typical paths followed by particular groups of patients. This is a non-trivial task given the dynamic na- ture of healthcare processes. The paper demonstrates the applicability of process mining using a real case of a gynecological oncology process in a Dutch hos- pital. Using a variety of process mining techniques, we analyzed the healthcare process from three different perspectives: (1) the control flow perspective, (2) the organizational perspective and (3) the performance perspective. In order to do so we extracted relevant event logs from the hospitals information system and ana- lyzed these logs using the ProM framework. The results show that process mining can be used to provide new insights that facilitate the improvement of existing careflows.

Application of Process Mining in Healthcare – A Case Study in a Dutch Hospital

We may not be able to make you love reading, but production workflow concepts and techniques will lead you to love reading starting from now. Book is the window to open the new world. The world that you want is in the better stage and level. World will always guide you to even the prestige stage of the life. You know, this is some of how reading will give you the kindness. In this case, more books you read more knowledge you know, but it can mean also the bore is full.

Production workflow: concepts and techniques

We present a Petri net semantics for the Business Process Execution Language for Web Services (BPEL) Our semantics covers the standard behaviour of BPEL as well as the exceptional behaviour (eg faults, events, compensation) The semantics is implemented as a parser that translates BPEL specifications into the input language of the Petri net model checking tool LoLA We demonstrate that the semantics is well suited for computer aided verification purposes

Transforming BPEL to petri nets

In Process-Aware Information Systems, business processes are often modeled in an explicit way. Roughly speaking, the available business process modeling languages can be divided into two groups.Languages from the first group are preferred by academic people but shunned by business people, and include Petri nets and process algebras. These academic languages have a proper formal semantics, which allows the corresponding academic models to be verified in a formal way. Languages from the second group are preferred by business people but disliked by academic people, and include BPEL, BPMN, and EPCs. These business languages often lack any proper semantics, which often leads to debates on how to interpret certain business models. Nevertheless, business models are used in practice, whereas academic models are hardly used. To be able to use, for example, the abundance of Petri net verification techniques on business models, we need to be able to transform these models to Petri nets. In this paper, we investigate a number of Petri net transformations that already exist.For every transformation, we investigate the transformation itself, the constructs in the business models that are problematic for the transformation and the main applications for the transformation.

/pdf/petri-net-transformations-for-business-processes-a-survey-21qznf70vz.pdf

Petri Net Transformations for Business Processes --- A Survey

Invited Papers.- Petri Nets, Discrete Physics, and Distributed Quantum Computation.- Autonomous Distributed System and Its Realization by Multi Agent Nets.- Petri Nets Without Tokens.- Toward Specifications for Reconfigurable Component Systems.- Generating Petri Net State Spaces.- Full Papers.- Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms.- Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets.- Improving Static Variable Orders Via Invariants.- Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems.- From Many Places to Few: Automatic Abstraction Refinement for Petri Nets.- A Compositional Method for the Synthesis of Asynchronous Communication Mechanisms.- History-Dependent Petri Nets.- Complete Process Semantics for Inhibitor Nets.- Behaviour-Preserving Transition Insertions in Unfolding Prefixes.- Combining Decomposition and Unfolding for STG Synthesis.- Object Nets for Mobility.- Web Service Orchestration with Super-Dual Object Nets.- Synthesis of Elementary Net Systems with Context Arcs and Localities.- Nets with Tokens Which Carry Data.- Operating Guidelines for Finite-State Services.- Theory of Regions for the Synthesis of Inhibitor Nets from Scenarios.- Utilizing Fuzzy Petri Net for Choreography Based Semantic Web Services Discovery.- Formal Models for Multicast Traffic in Network on Chip Architectures with Compositional High-Level Petri Nets.- Name Creation vs. Replication in Petri Net Systems.- Modelling the Datagram Congestion Control Protocol's Connection Management and Synchronization Procedures.- The ComBack Method - Extending Hash Compaction with Backtracking.- Computing Minimal Elements of Upward-Closed Sets for Petri Nets.- Tool Papers.- ProM 4.0: Comprehensive Support for Real Process Analysis.- dmcG: A Distributed Symbolic Model Checker Based on GreatSPN.- Workcraft: A Static Data Flow Structure Editing, Visualisation and Analysis Tool.

/pdf/petri-nets-and-other-models-of-concurrency-icatpn-2007-46rwm7a703.pdf

Petri nets and Other Models of Concurrency – ICATPN 2007

Team automata have been proposed in Ellis (1997) as a formal framework for modeling both the conceptual and the architectural level of groupware systems. Here we define team automata in a mathematically precise way in terms of component automata which synchronize on certain executions of actions. At the conceptual level, our model serves as a formal framework in which basic groupware notions can be rigorously defined and studied. At the architectural level, team automata can be used as building blocks in the design of groupware systems.

http://fmt.isti.cnr.it/~mtbeek/cscw03.pdf

Synchronizations in Team Automata for Groupware Systems

Application and Theory of Petri Nets 1999

In Memoriam: Carl Adam Petri.- Strategies for Modeling Complex Processes Using Colored Petri Nets.- Applications of Coloured Petri Nets for Functional Validation of Protocol Designs.- Business Process Modeling Using Petri Nets.- Structure Theory of Petri Nets.- Causality in Extensions of Petri Nets.- External Behaviour of Systems of State Machines with Variables.- The Synthesis Problem.- Models from Scenarios.- Discovering Petri Nets from Event Logs.

Transactions on Petri nets and other models of concurrency

We consider the modelling of the behaviour of membrane systems using Petri nets. First, a systematic, structural link is established between a basic class of membrane systems and Petri nets. To capture the compartmentisation of membrane systems, localities are proposed as an extension of Petri nets. This leads to a locally maxima] concurrency semantics for Petri nets. We indicate how processes for these nets could be defined which should be of use in order to describe what is actually going on during a computation of a membrane system.

Jetty Kleijn

Papers

Petri nets and Other Models of Concurrency – ICATPN 2007

Synchronizations in Team Automata for Groupware Systems

Application and Theory of Petri Nets 1999

Transactions on Petri nets and other models of concurrency

Towards a petri net semantics for membrane systems