Results 1  10
of
127
Faster and More Focused ControlFlow Analysis for Business Process Models through SESE Decomposition
, 2007
"... ..."
Diagnosis of Asynchronous Discrete Event Systems, a Net Unfolding Approach
 IEEE TRANS. ON AUTOMATIC CONTROL
, 2001
"... In this paper we formulate asynchronous diagnosis by means of hidden state history reconstruction, from alarm observations. We follow a socalled true concurrency approach, in which no global state and no global time is available. Instead, we use only local states in combination with a partial order ..."
Abstract

Cited by 69 (28 self)
 Add to MetaCart
(Show Context)
In this paper we formulate asynchronous diagnosis by means of hidden state history reconstruction, from alarm observations. We follow a socalled true concurrency approach, in which no global state and no global time is available. Instead, we use only local states in combination with a partial order model of time, in which local events are ordered if they are either generated on the same site, or related via some causality relation. Our basic mathematical tool is that of net unfoldings originating from the Petri net research area. This study was motivated by the problem of event correlation in telecommunications network management.
Petri Nets for Systems and Synthetic Biology
"... Abstract. We give a description of a Petri netbased framework for modelling and analysing biochemical pathways, which unifies the qualitative, stochastic and continuous paradigms. Each perspective adds its contribution to the understanding of the system, thus the three approaches do not compete, bu ..."
Abstract

Cited by 53 (15 self)
 Add to MetaCart
(Show Context)
Abstract. We give a description of a Petri netbased framework for modelling and analysing biochemical pathways, which unifies the qualitative, stochastic and continuous paradigms. Each perspective adds its contribution to the understanding of the system, thus the three approaches do not compete, but complement each other. We illustrate our approach by applying it to an extended model of the three stage cascade, which forms the core of the ERK signal transduction pathway. Consequently our focus is on transient behaviour analysis. We demonstrate how qualitative descriptions are abstractions over stochastic or continuous descriptions, and show that the stochastic and continuous models approximate each other. Although our framework is based on Petri nets, it can be applied more widely to other formalisms which are used to model and analyse biochemical networks. 1
Distributed monitoring of concurrent and asynchronous systems
, 2005
"... In this paper we study the diagnosis of distributed asynchronous systems with concurrency. Diagnosis is performed by a peertopeer distributed architecture of supervisors. Our approach relies on Petri net unfoldings and event structures, as means to manipulate trajectories of systems with concurre ..."
Abstract

Cited by 35 (16 self)
 Add to MetaCart
(Show Context)
In this paper we study the diagnosis of distributed asynchronous systems with concurrency. Diagnosis is performed by a peertopeer distributed architecture of supervisors. Our approach relies on Petri net unfoldings and event structures, as means to manipulate trajectories of systems with concurrency. This article is an extended version of the paper with same title, which appeared as a plenary address in the Proceedings of CONCUR’2003.
Petri Net Supervisors for DES with Uncontrollable and Unobservable Transitions
 IEEE Transactions on Automatic Control
, 1999
"... A supervisor synthesis technique for Petri net plants with uncontrollable and unobservable transitions that enforces the conjunction of a set of linear inequalities on the reachable markings of the plant is presented. The approach is based on the concept of Petri net place invariants. Each step o ..."
Abstract

Cited by 33 (12 self)
 Add to MetaCart
(Show Context)
A supervisor synthesis technique for Petri net plants with uncontrollable and unobservable transitions that enforces the conjunction of a set of linear inequalities on the reachable markings of the plant is presented. The approach is based on the concept of Petri net place invariants. Each step of the procedure is illustrated through a running example involving the supervision of a robotic assembly cell. The controller is described by an auxiliary Petri net connected to the plant's transitions, providing a unified Petri net model of the closed loop system. The synthesis technique is based on the concept of admissible constraints. An inadmissible constraint can not be directly enforced on a plant due to the uncontrollability or unobservability of certain plant transitions. Procedures are given for identifying all admissible linear constraints for a plant with uncontrollable and unobservable transitions, as well as methods for transforming inadmissible constraints into admissib...
Markov Nets: Probabilistic Models for distributed and concurrent systems
 IEEE Transactions on Automatic Control
, 2001
"... For distributed systems, i.e. large networked complex systems, there is a drastic difference between a local view and knowledge of the system, and its global view. Distributed systems have local state and time, but do not possess global state and time in the usual sense. In this paper, motivated by ..."
Abstract

Cited by 33 (16 self)
 Add to MetaCart
(Show Context)
For distributed systems, i.e. large networked complex systems, there is a drastic difference between a local view and knowledge of the system, and its global view. Distributed systems have local state and time, but do not possess global state and time in the usual sense. In this paper, motivated by the monitoring of distributed systems and in particular of telecommunications networks, we develop Markov nets as an extension of Markov chains and hidden Markov models (Hmm) for distributed and concurrent systems. By a concurrent system, we mean a system in which components may evolve independently, with sparse synchronizations. We follow a socalled true concurrency approach, in which neither global state nor global linear time are available. Instead, we use only local states in combination with a partial order model of time. Our basic mathematical tool is that of Petri net unfoldings. Keywords : discrete event systems, stochastic Petri nets, unfoldings. 1 Motivations Distributed network...
M.: Soundness and separability of workflow nets in the stepwise refinement approach
 ATPN 2003. LNCS
, 2003
"... Abstract. Workflow nets are recognized as a modelling paradigm for the business process modelling. We introduce and investigate several correctness notions for workflow nets, ranging from proper termination of cases to their mutual independence. We define refinement operators for nets and investiga ..."
Abstract

Cited by 27 (8 self)
 Add to MetaCart
(Show Context)
Abstract. Workflow nets are recognized as a modelling paradigm for the business process modelling. We introduce and investigate several correctness notions for workflow nets, ranging from proper termination of cases to their mutual independence. We define refinement operators for nets and investigate preservation of correctness through these operators. This gives rise to a class of nets that are provably correct.
Models of Computation for Embedded System Design
 in SystemLevel Synthesis
, 1998
"... In the near future, most objects of common use will contain electronics to augment their functionality, performance, and safety. Hence, timetomarket, safety, lowcost, and reliability will have to be addressed by any system design methodology. A fundamental aspect of system design is the specificat ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
(Show Context)
In the near future, most objects of common use will contain electronics to augment their functionality, performance, and safety. Hence, timetomarket, safety, lowcost, and reliability will have to be addressed by any system design methodology. A fundamental aspect of system design is the specification process. We advocate using an unambiguous formalism to represent design specifications and design choices. This facilitates tremendously efficiency of specification, formal verification, and correct design refinement, optimization, and implementation. This formalism is often called model of computation. There are several models of computation that have been used, but there is a lack of consensus among researchers and practitioners on the "right" models to use. To the best of our knowledge, there has also been little effort in trying to compare rigorously these models of computation. In this paper, we review current models of computation and compare them within a framework that has been r...
Distributed Diagnosis of discreteevent systems using Petri net unfoldings
 Proc. of ICATPN 2003, volume 2679 of LNCS
, 2003
"... Abstract. The problem of detecting and isolating fault events in dynamic systems modeled as discreteevent systems is considered. The modeling formalism adopted is that of Petri nets with labeled transitions, where some of the transitions are labeled by different types of unobservable fault events ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
(Show Context)
Abstract. The problem of detecting and isolating fault events in dynamic systems modeled as discreteevent systems is considered. The modeling formalism adopted is that of Petri nets with labeled transitions, where some of the transitions are labeled by different types of unobservable fault events. The Diagnoser Approach for discreteevent systems modeled by automata developed in earlier work is adapted and extended to online fault diagnosis of systems modeled by Petri nets, resulting in a centralized diagnosis algorithm based on the notion of “Petri net diagnosers”. A distributed version of this centralized algorithm is also presented. This distributed version assumes that the Petri net model of the system can be decomposed into two placebordered Petri nets satisfying certain conditions and that the two resulting Petri net diagnosers can exchange messages upon the occurrence of observable events. It is shown that this distributed algorithm is correct in the sense that it recovers the same diagnostic information as the centralized algorithm. The distributed algorithm provides an approach for tackling fault diagnosis of large complex systems. 1