Name
Abstract | ||
|---|---|---|
We study the construction of labelled transition systems from reactive systems defined over directed bigraphs, a computational meta-model which subsumes other variants of bigraphs. First we consider wide transition systems whose labels are all those generated by the IPO construction; the corresponding bisimulation is always a congruence. Then, we show that these LTSs can be simplified further by restricting to a subclass of labels, which can be characterized syntactically. We apply this theory to the Fusion calculus: we give an encoding of Fusion in directed bigraphs, and describe its simplified wide transition system and corresponding bisimulation. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-74407-8_26 | CONCUR |
Keywords | Field | DocType |
reactive system,ipo construction,labelled transition system,wide transition system,fusion calculus,corresponding bisimulation,computational meta-model,meta model | Transition system,Discrete mathematics,Bigraph,Computer science,Theoretical computer science,Bisimulation,Reactive system,Congruence (geometry),Encoding (memory) | Conference |
Volume | ISSN | ISBN |
4703 | 0302-9743 | 3-540-74406-1 |
Citations | PageRank | References |
16 | 0.95 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Davide Grohmann | 1 | 59 | 5.71 |
| Marino Miculan | 2 | 502 | 43.24 |