427 search results - page 5 / 86 » On the Power of Labels in Transition Systems |
FORTE
1990
13 years 8 months ago
1990
This paper describes a decision procedure for bisimulation-based equivalence relations between labeled transition systems. The algorithm usually performed in order to verify bisim...
BIRTHDAY
2009
Springer
13 years 5 months ago
2009
Springer
Weighted transition systems are defined, parametrized by a commutative monoid of weights. These systems are further understood as coalgebras for functors of a specific form. A gene...
LICS
2000
IEEE
13 years 12 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 ...
CONCUR
1998
Springer
13 years 11 months ago
1998
Springer
Alternating transition systems are a general model for composite systems which allow the study of collaborative as well as adversarial relationships between individual system compo...
ACTA
2007
13 years 7 months ago
2007
Abstract This paper introduces the notion of well-structured language. A wellstructured language can be defined by a labelled well-structured transition system, equipped with an u...