Conditional Bigraphs

Bigraphs are a universal graph based model, designed for analysing reactive systems that include spatial and non-spatial (e.g. communication) relationships. Bigraphs evolve over time using a rewriting framework that finds instances of a (sub)-bigraph, and substitutes a new bigraph. In standard bigraphs, the applicability of a rewrite rule is determined completely by a local match and does not allow any non-local reasoning, i.e. contextual conditions. We introduce conditional bigraphs that add conditions to rules and show how these fit into the matching framework for standard bigraphs. An implementation is provided, along with a set of examples. Finally, we discuss the limits of application conditions within the existing matching framework and present ways to extend the range of conditions that may be expressed.

[1]  Vincenzo Ciancia,et al.  Specifying and Verifying Properties of Space , 2014, IFIP TCS.

[2]  Hartmut Ehrig,et al.  Bigraphs meet Double Pushouts , 2002, Bull. EATCS.

[3]  Muffy Calder,et al.  Bigraphs with sharing , 2015, Theor. Comput. Sci..

[4]  Michele Sevegnani,et al.  BigraphTalk: Verified Design of IoT Applications , 2020, IEEE Internet of Things Journal.

[5]  Michele Sevegnani,et al.  Bigraphs with sharing and applications in wireless networks , 2012 .

[6]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[7]  Muffy Calder,et al.  Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing , 2012, Formal Aspects of Computing.

[8]  MeseguerJosé.  Conditional rewriting logic as a unified model of concurrency , 1992 .

[9]  Annegret Habel,et al.  Nested Constraints and Application Conditions for High-Level Structures , 2005, Formal Methods in Software and Systems Modeling.

[10]  Vladimiro Sassone,et al.  Spatial Logics for Bigraphs , 2005, ICALP.

[11]  Robin Milner,et al.  The Space and Motion of Communicating Agents , 2009 .

[12]  Julie A. McCann,et al.  Modelling and Verification of Large-Scale Sensor Network Infrastructures , 2018, 2018 23rd International Conference on Engineering of Complex Computer Systems (ICECCS).

[13]  Bashar Nuseibeh,et al.  On the Automated Management of Security Incidents in Smart Spaces , 2019, IEEE Access.

[14]  Muffy Calder,et al.  Real-time verification of wireless home networks using bigraphs with sharing , 2014, Sci. Comput. Program..

[15]  Jan A. Bergstra,et al.  Term-Rewriting Systems with Rule Priorities , 1989, Theor. Comput. Sci..

[16]  Pawel Sobocinski.  Deriving process congruences from reaction rules , 2004 .

[17]  Robin Milner,et al.  Stochastic Bigraphs , 2008, MFPS.

[18]  Muffy Calder,et al.  BigraphER: Rewriting and Analysis Engine for Bigraphs , 2016, CAV.

[19]  Barbara König,et al.  Conditional Reactive Systems , 2011, FSTTCS.

[20]  Steve Benford,et al.  On Lions, Impala, and Bigraphs , 2016, ACM Trans. Comput. Hum. Interact..

[21]  Reiko Heckel,et al.  Graph Grammars with Negative Application Conditions , 1996, Fundam. Informaticae.