Abstract
Bigraphs are a general framework for mobile, concurrent, and communicating systems. They have been shown to be suitable for representing several process calculi formalisms, but despite their expressive power, in many cases some disciplines on the structure of bigraphs are needed to faithfully encode the computational model at hand. Sortings have been proposed as an abstract technique to discipline bigraphs.
In this paper, we study the decidability problem of bigraphical sorting: to decide whether a bigraph belongs to some sorted bigraph category. Whilst the general problem is undecidable, we propose a decidable sub-class of bigraphical sortings, named match predicate sortings, which are expressive enough to capture homomorphic sortings and local bigraphs.
In this paper, we study the decidability problem of bigraphical sorting: to decide whether a bigraph belongs to some sorted bigraph category. Whilst the general problem is undecidable, we propose a decidable sub-class of bigraphical sortings, named match predicate sortings, which are expressive enough to capture homomorphic sortings and local bigraphs.
| Originalsprog | Engelsk |
|---|---|
| Titel | CTIT Workshop Proceedings WP 2010-05 |
| Publikationsdato | 2010 |
| Sider | 33-47 |
| Status | Udgivet - 2010 |
| Udgivet eksternt | Ja |
| Begivenhed | Workshop on Graph Computation Models - Enschede, Holland Varighed: 2 okt. 2010 → 2 okt. 2010 Konferencens nummer: 3 |
Workshop
| Workshop | Workshop on Graph Computation Models |
|---|---|
| Nummer | 3 |
| Land/Område | Holland |
| By | Enschede |
| Periode | 02/10/2010 → 02/10/2010 |