LICS
2000
IEEE
13 years 9 months ago
2000
IEEE
We study syntax-free models for name-passing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support t...
LICS
2000
IEEE
13 years 9 months ago
2000
IEEE
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats ...
SERA
2007
Springer
13 years 10 months ago
2007
Springer
Robustness is an important feature required for embedded systems. This paper presents a methodology to test robustness of such systems. We investigate system behaviour aspects. We...
CONCUR
2007
Springer
13 years 10 months ago
2007
Springer
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...
CALCO
2009
Springer
13 years 11 months ago
2009
Springer
d abstract) Sam Staton Computer Laboratory, University of Cambridge Abstract. A labelled transition system can be understood as a coalgebra for a particular endofunctor on the cate...
SIGSOFT
2003
ACM
14 years 5 months ago
2003
ACM
State machine based formalisms such as labelled transition systems (LTS) are generally assumed to be complete descriptions m behaviour at some level of abstraction: if a labelled ...