Modelling of Bonding with Processes and Events

We introduce two forms of modelling of systems that consist of objects that are combined together by the means of bonds. In reaction systems for bonding we define how bonds are created and dissolved via reduction-style semantics. The usefulness of reaction systems is illustrated with examples taken from software engineering and biochemistry. We also introduce reversible event structures and define the notion of configuration. We then discuss how to give semantics of reaction systems for bonding in terms of reversible event structures.

[1]  Irek Ulidowski,et al.  A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway , 2012, RC.

[2]  Grzegorz Rozenberg,et al.  Advances in Petri Nets 1985 , 1985, Lecture Notes in Computer Science.

[3]  Jan Kratochvíl,et al.  Mathematical Foundations of Computer Science 2004 , 2004, Lecture Notes in Computer Science.

[4]  Vincent Danos,et al.  Formal Molecular Biology Done in CCS-R , 2007, Electron. Notes Theor. Comput. Sci..

[5]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[6]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[7]  Parosh Aziz Abdulla,et al.  Advanced Ramsey-Based Büchi Automata Inclusion Testing , 2011, CONCUR.

[8]  Ivan Lanese,et al.  Reversing Higher-Order Pi , 2010, CONCUR.

[9]  Ivan Lanese,et al.  Controlling Reversibility in Higher-Order Pi , 2011, CONCUR.

[10]  Gordon D. Plotkin,et al.  Event Structures for Resolvable Conflict , 2004, MFCS.

[11]  Daniele Varacca,et al.  Typed event structures and the linear pi-calculus , 2010, Theor. Comput. Sci..

[12]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[13]  Cosimo Laneve,et al.  Reversible structures , 2011, CMSB.

[14]  Iain C. C. Phillips,et al.  Reversing algebraic process calculi , 2007, J. Log. Algebraic Methods Program..

[15]  Vincent Danos,et al.  Formal Molecular Biology done in CCS , 2003 .

[16]  Gordon D. Plotkin,et al.  Configuration structures, event structures and Petri nets , 2009, Theor. Comput. Sci..

[17]  Eugene M. Luks.  Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time , 1980, FOCS.

[18]  Irek Ulidowski,et al.  Reversibility and Models for Concurrency , 2007, Electron. Notes Theor. Comput. Sci..

[19]  Vincent Danos,et al.  Transactions in RCCS , 2005, CONCUR.

[20]  Paul Gastin,et al.  CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings , 2010, CONCUR.

[21]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[22]  Glynn Winskel,et al.  Events, Causality and Symmetry , 2008, Comput. J..