scispace - formally typeset
Search or ask a question
Topic

Process architecture

About: Process architecture is a research topic. Over the lifetime, 4876 publications have been published within this topic receiving 104171 citations.


Papers
More filters
Proceedings ArticleDOI
11 Dec 1996
TL;DR: A model which provides a simple graphical representation of hybrid systems and takes advantage of the modular structure of Petri nets in giving a compact description of systems composed of interacting subsystems, both time-continuous and discrete-event.
Abstract: The paper presents a model which provides a simple graphical representation of hybrid systems and takes advantage of the modular structure of Petri nets in giving a compact description of systems composed of interacting subsystems, both time-continuous and discrete-event. The modelling formalism seems rich enough to encompass large classes of hybrid systems and can easily represent many of the features of the models given in the literature.

22 citations

Book
05 Oct 2010
TL;DR: This book surveys more than ten years of research work about a framework of composable coloured Petri nets that can be extended with various features: control flow, synchronous communication, exceptions, threads, functions and time.
Abstract: This book surveys more than ten years of research work about a framework of composable coloured Petri nets. This framework is organised around a core model of coloured Petri nets that can be extended with various features: control flow, synchronous communication, exceptions, threads, functions and time. Extensions are made in such a way that the underlying model of coloured Petri net is preserved and the usual analysis tools and techniques can still be used. However, specific verifications issues arise from the proposed approaches; we discuss these issues and propose solutions to enable for efficient verification. An implementation of the framework is also presented, as well as applications to the modelling and verification of security protocols, and to the modelling and analysis of biological regulatory networks in the context of developmental processes.

22 citations

Journal ArticleDOI
TL;DR: The premise of this article is to show that the reachability relation for continuous Petri nets is definable by a sentence of linear size in the existential theory of the rationals with addition and order, and to leverage the power of modern SMT-solvers to yield a highly performant and robust decision procedure for coverability in Petrinets.
Abstract: Continuous Petri nets are a relaxation of classical discrete Petri nets in which transitions can be fired a fractional number of times, and consequently places may contain a fractional number of tokens. Such continuous Petri nets are an appealing object to study, since they over-approximate the set of reachable configurations of their discrete counterparts, and their reachability problem is known to be decidable in polynomial time. The starting point of this article is to show that the reachability relation for continuous Petri nets is definable by a sentence of linear size in the existential theory of the rationals with addition and order. Using this characterization, we obtain decidability and complexity results for a number of classical decision problems for continuous Petri nets. In particular, we settle the open problem about the precise complexity of reachability set inclusion. Finally, we show how continuous Petri nets can be incorporated inside the classical backward coverability algorithm for discrete Petri nets as a pruning heuristic to tackle the symbolic state explosion problem. The cornerstone of the approach we present is that our logical characterization enables us to leverage the power of modern SMT-solvers to yield a highly performant and robust decision procedure for coverability in Petri nets. We demonstrate the applicability of our approach on a set of standard benchmarks from the literature.

22 citations

Book ChapterDOI
08 Apr 2002
TL;DR: The aim of this paper is to give a mathematical foundation for design and analysis of multi-agent systems by means of a Petri-net-based model, called PN2, based on place/transition nets, which is one of the simplest classes of Petri nets.
Abstract: Agent technology is widely recognized as a new paradigm for design of concurrent software and systems. The aim of this paper is to give a mathematical foundation for design and analysis of multi-agent systems by means of a Petri-net-based model. The proposed model, called PN2, is based on place/transition nets (P/T nets), which is one of the simplest classes of Petri nets. The main difference between PN2s and P/T nets is that each token, representing an agent, is also a P/T net. State equation and invariants are known as standard techniques for the analysis of P/T nets. As the first step of mathematical analysis of PN2s, we define these for PN2s, and show how the invariants are computed in an efficient way.

22 citations


Network Information
Related Topics (5)
Software development
73.8K papers, 1.4M citations
82% related
Scheduling (computing)
78.6K papers, 1.3M citations
82% related
Control theory
299.6K papers, 3.1M citations
82% related
Control system
129K papers, 1.5M citations
81% related
Server
79.5K papers, 1.4M citations
81% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202318
202249
20216
20207
201916
201821