427 search results - page 21 / 86 » On the Power of Labels in Transition Systems |
LICS
2009
IEEE
15 years 6 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
100
click to vote
ESEC
1999
Springer
15 years 4 months ago
1999
Springer
The liveness characteristics of a system are intimately related to the notion of fairness. However, the task of explicitly modelling fairness constraints is complicated in practice...
ACSD
2003
IEEE
15 years 5 months ago
2003
IEEE
Message Sequence Charts (MSC) have been traditionally used to depict execution scenarios in the early stages of design cycle. MSCs portray inter-process ( inter-object) interactio...
93
Voted
ACTA
2010
14 years 12 months ago
2010
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
114
click to vote
ESSLLI
2009
Springer
14 years 9 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...