Transactions on Petri Nets and Other Models of Concurrency V

Associated with a chemical reaction network is a natural labelled bipartite multigraph termed an SR graph, and its directed version, the DSR graph. These objects are closely related to Petri nets, but encode weak assumptions on the reaction kinetics, and are more generally associated with continuous-time, continuous-state models rather than discrete-event systems. The construction of SR and DSR graphs for chemical reaction networks is presented. Conclusions about asymptotic behaviour of the associated dynamical systems which can be drawn easily from the graphs are discussed. In particular, theorems on ruling out the possibility of multiple equilibria or stable oscillation based on computations on SR/DSR graphs are presented. These include both published and new results. The power and limitations of such results are illustrated via several examples. 1 Chemical Reaction Networks: Structure and Kinetics Models of chemical reaction networks (CRNs) are able to display a rich variety of dynamical behaviours [1]. In this paper, a spatially homogeneous setting is assumed, and the state of a CRN is defined to be the set of concentrations of the reactants involved, each a nonnegative real number. In addition, continuoustime models are treated, so that CRNs involving n chemicals give rise to local semiflows on R≥0, the nonnegative orthant in R . These local semiflows are fully determined if we know 1) the CRN structure, that is, which chemicals react with each other and in what proportions, and 2) the CRN kinetics, that is, how the reaction rates depend on the chemical concentrations. An important question is which CRN behaviours are determined primarily by reaction network structure, with limited assumptions about the kinetics. As will be seen below, a variety of representations of CRN structure are possible, for example via matrices or generalised graphs. Some of these representations encode weak assumptions on the reaction kinetics. Of these, a signed, labelled, bipartite multigraph, termed an SR graph, and its directed version, 1 The term derives from “species-reaction graph” [2]. However, while CRNs provided the original motivation for their construction, such graphs have since proved useful in more general contexts. The construction here follows [3]. K. Jensen, S. Donatelli, and J. Kleijn (Eds.): ToPNoC V, LNCS 6900, pp. 1–21, 2012. c © Springer-Verlag Berlin Heidelberg 2012

[1]  Thomas Wagner Prototypische Realisierung einer Integration von Agenten und Workflows , 2010, Informatiktage.

[2]  Kim G. Larsen,et al.  Complexity of Decision Problems for Mixed and Modal Specifications , 2008, FoSSaCS.

[3]  Raffaela Mirandola,et al.  The Common Component Modeling Example: Comparing Software Component Models [result from the Dagstuhl research seminar for CoCoME, August 1-3, 2007] , 2007, CoCoME.

[4]  L. Thiele,et al.  Symbolic model checking of process networks using interval diagram techniques , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[5]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[6]  Jean-Baptiste Raclet Quotient de spécifications pour la réutilisation de composants , 2007 .

[7]  Ernst W. Mayr An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[8]  Rolf Hennicker,et al.  On Weak Modal Compatibility, Refinement, and the MIO Workbench , 2010, TACAS.

[9]  Walter Vogler,et al.  Output-Determinacy and Asynchronous Circuit Synthesis , 2007, Seventh International Conference on Application of Concurrency to System Design (ACSD 2007).

[10]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[11]  Wil M. P. van der Aalst,et al.  Verification of Workflow Nets , 1997, ICATPN.

[12]  Kim G. Larsen,et al.  On Modal Refinement and Consistency , 2007, CONCUR.

[13]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[14]  Heiko Rölke Modellierung von Agenten und Multiagentensystemen: Grundlagen und Anwendungen , 2004 .

[15]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[16]  Rüdiger Valk,et al.  Concurrency in Communicating Object Petri Nets , 2001, Concurrent Object-Oriented Programming and Petri Nets.

[17]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[18]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[19]  Thomas A. Henzinger,et al.  Interface Theories for Component-Based Design , 2001, EMSOFT.

[20]  Thomas A. Henzinger,et al.  INTERFACE-BASED DESIGN , 2005 .

[21]  Kim G. Larsen,et al.  Modal I/O Automata for Interface and Product Line Theories , 2007, ESOP.

[22]  Kim G. Larsen,et al.  Decision Problems for Interval Markov Chains , 2011, LATA.

[23]  Alexander Knapp,et al.  Modal Interface Theories for Communication-Safe Component Assemblies , 2011, ICTAC.

[24]  Jiacun Wang,et al.  WIFAi - A tool suite for the modeling and enactment of inter-organizational workflows , 2009, 2009 IEEE/INFORMS International Conference on Service Operations, Logistics and Informatics.

[25]  Axel Legay,et al.  Modal interfaces: unifying interface automata and modal specifications , 2009, EMSOFT '09.

[26]  Kim G. Larsen,et al.  Modal Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[27]  Jean-Baptiste Raclet,et al.  Residual for Component Specifications , 2008, Electron. Notes Theor. Comput. Sci..

[28]  Michel Hack,et al.  Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[29]  Karsten Wolf,et al.  Deciding service composition and substitutability using extended operating guidelines , 2009, Data Knowl. Eng..

[30]  Alexander Knapp,et al.  On the Observable Behaviour of Composite Components , 2010, Electron. Notes Theor. Comput. Sci..

[31]  Nathalie Bertrand,et al.  A Compositional Approach on Modal Specifications for Timed Systems , 2009, ICFEM.

[32]  Kim G. Larsen,et al.  EXPTIME-complete Decision Problems for Modal and Mixed Specifications , 2009, EXPRESS.