Informatica Technical Report : 5 - 2010 CALCO Young Researchers Workshop CALCO - jnr 2009 6 September 2009 Selected

Abstract

Bigraphical reactive systems are a general framework for ubiquitous and mobile computing, which is based on the concepts of location and channel connection. Despite their expressive power, in many cases “specialized version” of bigraphs have been defined by means of bigraphical sortings to fit precisely the computational model at hand. This paper investigates if (bigraphical) sortings are decidable, that is, decide if a bigraph belongs or not to some sorting. In general it is not the case, but we have found and proposed a decidable class of sortings by reducing the problem at issue to the matching problem for bigraphs.

4 Figures and Tables

Cite this paper

@inproceedings{Haveraaen2010InformaticaTR, title={Informatica Technical Report : 5 - 2010 CALCO Young Researchers Workshop CALCO - jnr 2009 6 September 2009 Selected}, author={Magne Haveraaen and Marina Lenisa and John Power and Monika Seisenberger and Giorgio Bacci and Fabrice Barbier}, year={2010} }