Deriving labelled transition systems -- a structural approach
From MaRDI portal
Publication:3397630
zbMATH Open1191.68446MaRDI QIDQ3397630FDOQ3397630
Authors: Julian Rathke, Paweł Sobociński 
Publication date: 22 September 2009
Recommendations
- Deriving Structural Labelled Transitions for Mobile Ambients
- Deriving structural labelled transitions for mobile ambients
- Labelled transitions for mobile ambients (as synthesized via a graphical encoding)
- Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi
- Deriving Bisimulation Congruences with Borrowed Contexts
Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (10)
- Attributed transition systems with hidden transitions
- Sufficient conditions for the marked graph realisability of labelled transition systems
- Analysis of the structure of attributed transition systems without hidden transitions
- Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- A compositional proof system on a category of labelled transition systems
- Deriving structural labelled transitions for mobile ambients
- Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi
- Labelled transition logic: An outline
- Title not available (Why is that?)
This page was built for publication: Deriving labelled transition systems -- a structural approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3397630)
