10 search results - page 2 / 2 » Probabilistic and Topological Semantics for Timed Automata |
ENTCS
2008
13 years 5 months ago
2008
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
ATVA
2006
Springer
13 years 9 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
One of the core tasks in social network analysis is to predict the formation of links (i.e. various types of relationships) over time. Previous research has generally represented ...
EACL
2003
ACL Anthology
13 years 6 months ago
2003
ACL Anthology
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...