Abstract
We develop a theory of sorted bigraphical reactive systems.
Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand. Here we present a general construction of sortings. The constructed sortings always sustain the behavioural theory of pure bigraphs (in a precise sense), thus obviating the need to redevelop that theory for each new application. As an example, we recover Milner’s local bigraphs as a sorting on pure bigraphs.
Technically, we give our construction for ordinary reactive systems, then lift it to bigraphical reactive systems. As such, we give also a construction of sortings for ordinary reactive systems. This construction is an improvement over previous attempts in that it produces smaller and much more natural sortings, as witnessed by our recovery of local bigraphs as a sorting.
This work is funded in part by the Danish Research Agency (grants no.: 2059-03-0031 and no.: 274-06-0415) and the IT University of Copenhagen (the LaCoMoCo, BPL and CosmoBiz projects). Authors are listed alphabetically.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Milner, R.: Pure bigraphs: Structure and dynamics. Information and Computation 204(1), 60–122 (2006)
Milner, R., Leifer, J.J.: Transition systems, link graphs and Petri nets. Technical Report 598, U. of Cambridge Computer Laboratory (2004)
Milner, R.: Bigraphs whose names have multiple locality. Technical Report 603, U. of Cambridge Computer Laboratory (2004)
Jensen, O.H., Milner, R.: Bigraphs and mobile processes (revised). Technical Report 580, U. of Cambridge Computer Laboratory (2004)
Milner, R.: Bigraphs for petri nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 686–701. Springer, Heidelberg (2004)
Jensen, O.H.: Mobile Processes in Bigraphs. PhD thesis, U. of Aalborg (forthcoming 2008)
Bundgaard, M., Sassone, V.: Typed polyadic pi-calculus in bigraphs. In: PPDP 2006, pp. 1–12 (2006)
Grohmann, D., Miculan, M.: Reactive systems over directed bigraphs. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 380–394. Springer, Heidelberg (2007)
Bundgaard, M., Hildebrandt, T.: Bigraphical semantics of higher-order mobile embedded resources with local names. In: GT-VC 2005. ENTCS, vol. 154, pp. 7–29 (2006)
Milner, R.: Local bigraphs and confluence: Two conjectures. In: EXPRESS 2006, pp. 42–50 (2006)
Birkedal, L., Debois, S., Elsborg, E., Hildebrandt, T., Niss, H.: Bigraphical Models of Context-aware Systems. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921. Springer, Heidelberg (2006)
Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243–258. Springer, Heidelberg (2000)
Leifer, J.J.: Operational Congruences for Reactive Systems. PhD thesis, U. of Cambridge Computer Laboratory and Trinity College (2001)
Sewell, P.: From rewrite rules to bisimulation congruences. Theoretical Computer Science 274(1–2), 183–230 (2002)
Birkedal, L., Debois, S., Hildebrandt, T.: Sortings for reactive systems. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 248–262. Springer, Heidelberg (2006)
Debois, S.: Sortings and Bigraphs. PhD thesis, IT University of Copenhagen (2008), http://www.itu.dk/people/debois/pubs/thesis.pdf
Leifer, J.J.: Synthesising labelled transitions and operational congruences in reactive systems, part 2. Technical Report RR-4395, INRIA (2002)
Conforti, G., Macedonio, D., Sassone, V.: Spatial logics for bigraphs. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 766–778. Springer, Heidelberg (2005)
Sassone, V., Sobocinski, P.: Deriving bisimulation congruences: 2-categories vs. precategories. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 409–424. Springer, Heidelberg (2003)
Sassone, V., Sobocinski, P.: Reactive systems over cospans. In: LICS 2005, pp. 311–320. IEEE, Los Alamitos (2005)
Milner, R.: Personal communication (2006)
Bonchi, F., Gadducci, F., König, B.: Process bisimulation via a graphical encoding. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 168–183. Springer, Heidelberg (2006)
Ehrig, H., König, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. Mathematical Structures in Computer Science 16(6), 1133–1163 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Birkedal, L., Debois, S., Hildebrandt, T. (2008). On the Construction of Sorted Reactive Systems. In: van Breugel, F., Chechik, M. (eds) CONCUR 2008 - Concurrency Theory. CONCUR 2008. Lecture Notes in Computer Science, vol 5201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85361-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-85361-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85360-2
Online ISBN: 978-3-540-85361-9
eBook Packages: Computer ScienceComputer Science (R0)