22,156 research outputs found

    Educational process modelling with workflow and time Petri nets : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Computer Science at Massey University, Palmerston North, New Zealand

    Get PDF
    The research presented in this thesis describes how to use workflow management technology to model educational processes with a time axis. As workflow management technology has been widely used in modelling business processes, it has the potential to model educational processes. Based upon the components of workflow, educational processes and business processes have many common features such that educational processes can be modelled with workflow management technology. In addition, owing to the importance of the time component in processes, time Petri nets have been chosen as the design language for the modelling of the educational processes. The notation of time Petri nets has been illustrated in this thesis for the educational process. In this thesis, three different educational processes have been presented and modelled with workflow management technology as well as with time Petri nets individually. Furthermore, the architecture of the educational process management system has been constructed by adopting the reference model from the Workflow Management Coalition. To show the validity of using workflow management technology in the education domain, a sub-process of an educational process has been modelled and developed with certain developing techniques. It provides the potential research direction for further research on the modelling of educational process with workflow technology associated with a time component

    Process versus Unfolding Semantics for Place/Transition Petri Nets

    Get PDF
    In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classical "token game," one can model the behaviour of Petri nets via non-sequential processes, via unfolding constructions, which provide formal relationships between nets and domains, and via algebraic models, which view Petri nets as essentially algebraic theories whose models are monoidal categories. In this paper we show that these three points of view can be reconciled. In our formal development a relevant role is played by DecOcc, a category of occurrence nets appropriately decorated to take into account the history of tokens. The structure of decorated occurrence nets at the same time provides natural unfoldings for Place/Transition (PT) nets and suggests a new notion of processes, the decorated processes, which induce on Petri nets the same semantics as that of unfolding. In addition, we prove that the decorated processes of a net can be axiomatized as the arrows of a symmetric monoidal category which, therefore, provides the aforesaid unification

    Business process modeling using petri nets with clocks

    Get PDF
    Petri Nets are tools for the analysis and design of concurrent systems. There is a formal theory, which supports Petri Nets. We propose Petri Nets with Clocks which has a high expressive power in the concurrent and asynchronous process modeling and gives the possibility to model real time systems. The Petri Nets with Clocks are useful to model systems with temporal requirements via specification of clocks, using temporal invariants for the places and temporal conditions in the transitions. Also, we have developed an algorithm for the analysis of Petri Nets with Clocks. For the Business Processes Modeling, we propose to use Petri Nets with Clocks to formalize models, allowing to study the models through a quantitative and qualitative analysis. Petri Nets with Clocks includes additional temporal elements -clocks-, which are appropriate for the Business Processes Modeling and are not taken into consideration in the literature concerning the extensions of Petri Nets with time. Petri Nets with Clocks allows studying the structural properties of Business Processes Modeling. This study not only allows the simulation but also verifies formally the model. It is oriented to the verification and correction of errors in the modeling of the time variable en Business Processes.Eje: Ingeniería de softwareRed de Universidades con Carreras en Informática (RedUNCI

    Business process modeling using petri nets with clocks

    Get PDF
    Petri Nets are tools for the analysis and design of concurrent systems. There is a formal theory, which supports Petri Nets. We propose Petri Nets with Clocks which has a high expressive power in the concurrent and asynchronous process modeling and gives the possibility to model real time systems. The Petri Nets with Clocks are useful to model systems with temporal requirements via specification of clocks, using temporal invariants for the places and temporal conditions in the transitions. Also, we have developed an algorithm for the analysis of Petri Nets with Clocks. For the Business Processes Modeling, we propose to use Petri Nets with Clocks to formalize models, allowing to study the models through a quantitative and qualitative analysis. Petri Nets with Clocks includes additional temporal elements -clocks-, which are appropriate for the Business Processes Modeling and are not taken into consideration in the literature concerning the extensions of Petri Nets with time. Petri Nets with Clocks allows studying the structural properties of Business Processes Modeling. This study not only allows the simulation but also verifies formally the model. It is oriented to the verification and correction of errors in the modeling of the time variable en Business Processes.Eje: Ingeniería de softwareRed de Universidades con Carreras en Informática (RedUNCI

    Reachability of Communicating Timed Processes

    Full text link
    We study the reachability problem for communicating timed processes, both in discrete and dense time. Our model comprises automata with local timing constraints communicating over unbounded FIFO channels. Each automaton can only access its set of local clocks; all clocks evolve at the same rate. Our main contribution is a complete characterization of decidable and undecidable communication topologies, for both discrete and dense time. We also obtain complexity results, by showing that communicating timed processes are at least as hard as Petri nets; in the discrete time, we also show equivalence with Petri nets. Our results follow from mutual topology-preserving reductions between timed automata and (untimed) counter automata.Comment: Extended versio

    MathMC: A mathematica-based tool for CSL model checking of deterministic and stochastic Petri nets

    Get PDF
    Deterministic and Stochastic Petri Nets (DSPNs) are a widely used high-level formalism for modeling discreteevent systems where events may occur either without consuming time, after a deterministic time, or after an exponentially distributed time. CSL (Continuous Stochastic Logic) is a (branching) temporal logic developed to express probabilistic properties in continuous time Markov chains (CTMCs). In this paper we present a Mathematica-based tool that implements recent developments for model checking CSL style properties on DSPNs. Furthermore, as a consequence of the type of process underlying DSPNs (a superset of Markovian processes), we are also able to check CSL properties of Generalized Stochastic Petri Nets (GSPNs) and labeled CTMCs

    Business process modeling using petri nets with clocks

    Get PDF
    Petri Nets are tools for the analysis and design of concurrent systems. There is a formal theory, which supports Petri Nets. We propose Petri Nets with Clocks which has a high expressive power in the concurrent and asynchronous process modeling and gives the possibility to model real time systems. The Petri Nets with Clocks are useful to model systems with temporal requirements via specification of clocks, using temporal invariants for the places and temporal conditions in the transitions. Also, we have developed an algorithm for the analysis of Petri Nets with Clocks. For the Business Processes Modeling, we propose to use Petri Nets with Clocks to formalize models, allowing to study the models through a quantitative and qualitative analysis. Petri Nets with Clocks includes additional temporal elements -clocks-, which are appropriate for the Business Processes Modeling and are not taken into consideration in the literature concerning the extensions of Petri Nets with time. Petri Nets with Clocks allows studying the structural properties of Business Processes Modeling. This study not only allows the simulation but also verifies formally the model. It is oriented to the verification and correction of errors in the modeling of the time variable en Business Processes.Eje: Ingeniería de softwareRed de Universidades con Carreras en Informática (RedUNCI

    Modeling and analysis of semiconductor manufacturing processes using petri nets

    Get PDF
    This thesis addresses the issues in modeling and analysis of multichip module (MCM) manufacturing processes using Petri nets. Building such graphical and mathematical models is a crucial step to understand MCM technologies and to enhance their application scope. In this thesis, the application of Petri nets is presented with top-down and bottom-up approaches. The theory of Petri nets is summarized with its basic notations and properties at first. After that, the capability of calculating and analyzing Petri nets with deterministic timing information is extended to meet the requirements of the MCM models. Then, using top-down refining and system decomposition, MCM models are built from an abstract point to concrete systems with timing information. In this process, reduction theory based on a multiple-input-single-output modules for deterministic Petri nets is applied to analyze the cycle time of Petri net models. Besides, this thesis is of significance in its use of the reduction theory which is derived for timed marked graphs - an important class of Petri nets

    Towards a Notion of Distributed Time for Petri Nets

    No full text
    We set the ground for research on a timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. The novelty is that, rather than a single global clock, we use a set of unrelated clocks --- possibly one per place --- allowing a local timing as well as distributed time synchronisation. We give a formal definition of the model and investigate properties of local versus global timing, including decidability issues and notions of processes of the respective models
    corecore