Name
Abstract | ||
|---|---|---|
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection with (temporal) logic and related verification algorithms. In this paper, we will identify weighted versions of MSO and CTL that generalize the classical logics and even other quantitative extensions such as probabilistic CTL. We establish expressiveness results on our logics giving translations from weighted and probabilistic CTL into weighted MSO. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02737-6_2 | Developments in Language Theory |
Keywords | Field | DocType |
classical logic,finite automaton,weighted version,probabilistic ctl,expressiveness result,pure boolean,weighted automaton,natural connection,mature theory,weighted mso,probabilistic logic | Computation tree logic,T-norm fuzzy logics,Discrete mathematics,Combinatorics,Computer science,Automaton,Probabilistic CTL,Finite-state machine,Probabilistic logic,CTL*,Expressivity | Conference |
Volume | ISSN | Citations |
5583 | 0302-9743 | 22 |
PageRank | References | Authors |
0.78 | 31 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benedikt Bollig | 1 | 427 | 35.02 |
| Paul Gastin | 2 | 1165 | 75.66 |