Results 1  10
of
20
Decidability Issues for Petri Nets  a survey
, 1994
"... : We survey 25 years of research on decidability issues for Petri nets. We collect results on the decidability of important properties, equivalence notions, and temporal logics. 1. Introduction Petri nets are one of the most popular formal models for the representation and analysis of parallel proc ..."
Abstract

Cited by 89 (5 self)
 Add to MetaCart
: We survey 25 years of research on decidability issues for Petri nets. We collect results on the decidability of important properties, equivalence notions, and temporal logics. 1. Introduction Petri nets are one of the most popular formal models for the representation and analysis of parallel processes. They are due to C.A. Petri, who introduced them in his doctoral dissertation in 1962. Some years later, and independently from Petri's work, Karp and Miller introduced vector addition systems [47], a simple mathematical structure which they used to analyse the properties of "parallel program schemata', a model for parallel computation. In their seminal paper on parallel program schemata, Karp and Miller studied some decidability issues for vector addition systems, and the topic continued to be investigated by other researchers. When Petri's ideas reached the States around 1970, it was observed that Petri nets and vector addition systems were mathematically equivalent, even though thei...
Recognizable sets of message sequence charts
 STACS 2002, LNCS 2030
, 2002
"... Abstract. Highlevel Message Sequence Charts are a wellestablished formalism to specify scenarios of communications in telecommunication protocols. In order to deal with possibly unbounded specifications, we focus on starconnected HMSCs. We relate this subclass with recognizability and MSOdefinab ..."
Abstract

Cited by 27 (4 self)
 Add to MetaCart
Abstract. Highlevel Message Sequence Charts are a wellestablished formalism to specify scenarios of communications in telecommunication protocols. In order to deal with possibly unbounded specifications, we focus on starconnected HMSCs. We relate this subclass with recognizability and MSOdefinability by means of a new connection with Mazurkiewicz traces. Our main result is that we can check effectively whether a starconnected HMSC is realizable by a finite system of communicating automata with possibly unbounded channels. Message Sequence Charts (MSCs) are a popular model often used for the documentation of telecommunication protocols. They profit by a standardized visual and textual presentation (ITUT recommendation Z.120 [11]) and are related to other formalisms such as sequence diagrams of UML. An MSC gives a graphical description of communications between processes. It usually abstracts away from the values of variables and the actual contents of messages. However, this formalism can be used at a very early stage of design to detect errors in the specification
Flat Counter Automata Almost Everywhere
 In ATVA ’05
"... Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be “replaced”, equivalently w.r.t. reachability, by another one with no nested loops. From a practical view point, we show that ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be “replaced”, equivalently w.r.t. reachability, by another one with no nested loops. From a practical view point, we show that flatness is a necessary and sufficient condition for termination of accelerated symbolic model checking, a generic semialgorithmic technique implemented in successful tools like FAST, LASH or TREX. From a theoretical view point, we prove that many known semilinear subclasses of counter automata are flat: reversal bounded counter machines, lossy vector addition systems with states, reversible Petri nets, persistent and conflictfree Petri nets, etc. Hence, for these subclasses, the semilinear reachability set can be computed using a uniform accelerated symbolic procedure (whereas previous algorithms were specifically designed for each subclass). 1
Catalytic P systems, semilinear sets, and vector addition systems
 THEORETICAL COMPUTER SCIENCE
, 2004
"... We look at 1region membrane computing systems which only use rules of the form Ca Cv, where C is a catalyst anoncatalW:k and v is a(possiblW:kky string ofnoncatal sts. There are norulk of the form a v. Thus, we can think of these systems as"purelx catalxyMWe consider two types: (1) when ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
We look at 1region membrane computing systems which only use rules of the form Ca Cv, where C is a catalyst anoncatalW:k and v is a(possiblW:kky string ofnoncatal sts. There are norulk of the form a v. Thus, we can think of these systems as"purelx catalxyMWe consider two types: (1) when theinitial configuration containsonl onecatalxkA and (2) when theinitial configuration contains mulains catalsy" We show that systems of the first type are equivalyM to communicationfree Petri nets, which are aly equivalyM to commutative contextfree grammars. They defin epreciselkq semilel sets. ThispartialkyM:W"k an open question (in: WMCCdeA'02, Lecture Notes in Computer Science,vol 2597, Springer,Berlge 2003, pp. 400  409; Computational" universal P systems without priorities: two catal"k# are su#cient, availt,y at http://psystems.disco.unimib.it, 2003). Systems of the second type define exactl""# recursivelMkq""yl sets oftupl# (i.e., Turing machinecomputablWk Weal" studyan extended model where therul are of the form q :(p; Ca Cv) (where q and p are states), i.e., the appl":xyMk of therul is guided bya #nitestatecontrol For thisgeneral"yM model type (1) aswel as type (2) with some restriction correspond to vector addition systems. Finally, we briefly investigate the closure properties of catalytic systems.
Petri Nets for Modelling Metabolic Pathways: A Survey
"... Abstract. In the last fifteen years, several research efforts have been directed towards the representation and the analysis of metabolic pathways by using Petri nets. The goal of this paper is twofold. First, we discuss how the knowledge about metabolic pathways can be represented with Petri nets. ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
Abstract. In the last fifteen years, several research efforts have been directed towards the representation and the analysis of metabolic pathways by using Petri nets. The goal of this paper is twofold. First, we discuss how the knowledge about metabolic pathways can be represented with Petri nets. We point out the main problems that arise in the construction of a Petri net model of a metabolic pathway and we outline some solutions proposed in the literature. Second, we present a comprehensive review of recent research on this topic, in order to assess the maturity of the field and the availability of a methodology for modelling a metabolic pathway by a corresponding Petri net. 1
Normal and Sinkless Petri Nets
 Journal of Computer and System Sciences
, 1989
"... We examine both the modeling power of normal and sinkless Petri nets and the computational complexities of various classical decision problems with respect to these two classes. We argue that although neither normal nor sinkless Petri nets are strictly more powerful than persistent Petri nets, th ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
We examine both the modeling power of normal and sinkless Petri nets and the computational complexities of various classical decision problems with respect to these two classes. We argue that although neither normal nor sinkless Petri nets are strictly more powerful than persistent Petri nets, they nonetheless are both capable of modeling a more interesting class of problems. On the other hand, we give strong evidence that normal and sinkless Petri nets are easier to analyze than persistent Petri nets. In so doing, we apply techniques originally developed for conflictfree Petri nets  a class defined solely in terms of the structure of the the net  to sinkless Petri nets  a class defined in terms of the behavior of the net. As a result, we give the first comprehensive complexity analysis of a class of potentially unbounded Petri nets defined in terms of their behavior. 1 Introduction Many aspects of the fundamental nature of computation are often studied via formal m...
On P systems operating in sequential mode
 International Journal of Foundations of Computer Science
, 2004
"... 1. For 1membrane catalytic systems (CS's), the sequential version is strictlyweaker than the parallel version in that the former defines (i.e. generates) exactly the semilinear sets, whereas the latter is known to define nonrecursivesets. 2. For 1membrane communicating P systems (CPS's), ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
1. For 1membrane catalytic systems (CS's), the sequential version is strictlyweaker than the parallel version in that the former defines (i.e. generates) exactly the semilinear sets, whereas the latter is known to define nonrecursivesets. 2. For 1membrane communicating P systems (CPS's), the sequential versioncan only define a proper subclass of the semilinear sets, whereas the parallel version is known to define nonrecursive sets.3. Adding a new type of rule of the form: ab! axbyccomedcome to the CPS(a natural generalization of the rule ab! axbyccome in the original model),where x; y 2 fhere; outg, to the sequential 1membrane CPS makes itequivalent to a vector addition system.
On Yen’s Path Logic for Petri Nets
"... Abstract. In [13], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACEcomplete. In this paper, we show that in fact the satisfiability problem for this class of formulas is as hard as the reachability problem for Petri nets. Moreover, we sa ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract. In [13], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACEcomplete. In this paper, we show that in fact the satisfiability problem for this class of formulas is as hard as the reachability problem for Petri nets. Moreover, we salvage almost all of Yen’s results by defining a fragment of this class of formulas for which the satisfiability problem is EXPSPACEcomplete by adapting his proof. 1
Programmability of Chemical Reaction Networks
"... Summary. Motivated by the intriguing complexity of biochemical circuitry within individual cells we study Stochastic Chemical Reaction Networks (SCRNs), a formal model that considers a set of chemical reactions acting on a finite number of molecules in a wellstirred solution according to standard c ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Summary. Motivated by the intriguing complexity of biochemical circuitry within individual cells we study Stochastic Chemical Reaction Networks (SCRNs), a formal model that considers a set of chemical reactions acting on a finite number of molecules in a wellstirred solution according to standard chemical kinetics equations. SCRNs have been widely used for describing naturally occurring (bio)chemical systems, and with the advent of synthetic biology they become a promising language for the design of artificial biochemical circuits. Our interest here is the computational power of SCRNs and how they relate to more conventional models of computation. We survey known connections and give new connections between SCRNs and