275
click to vote
FOSSACS
14 years 9 months ago
2011 Springer 
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
198
click to vote
FOSSACS
14 years 9 months ago
2011 Springer 
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
179
click to vote
FOSSACS
14 years 9 months ago
2011 Springer
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
160
click to vote
FOSSACS
14 years 9 months ago
2011 Springer
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivat...
177
click to vote
FOSSACS
14 years 9 months ago
2011 Springer
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
|
Software Engineering