Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Theoretical Computer Science
Proof, language, and interaction
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
An Abstract Formulation for Rewrite Systems
Category Theory and Computer Science
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
Mathematical Structures in Computer Science
Deriving weak bisimulation congruences from reduction systems
CONCUR 2005 - Concurrency Theory
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Deriving Structural Labelled Transitions for Mobile Ambients
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Reactive Systems, Barbed Semantics, and the Mobile Ambients
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
Electronic Notes in Theoretical Computer Science (ENTCS)
Labels from reductions: towards a general theory
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
| Hi-index | 0.00 |
The theory of reactive systems (RSs) represents a fruitful proposal for deriving labelled transition systems (LTSs) from unlabelled ones. The synthesis of an LTS allows for the use of standard techniques in the analysis of systems, as witnessed by the widespread adoption of behavioral semantics. Recent proposals addressed one of the main drawbacks of RSs, namely, its restriction to the analysis of ground (i.e., completely specified) systems. A still unresolved issue concerns the lack of a presentation via inference rules for the derived LTS, thus hindering the modularity of the presentation. Our paper considers open RSs. We first introduce a variant of the current proposal based on "luxes": our technique is applicable to a larger number of case studies and, under some conditions, it synthesises a smaller LTS. Then, we illustrate how the LTS derived by using our approach can be equipped with a SOS-like presentation via an encoding into tile systems.