493 search results - page 7 / 99 » Alternating Weighted Automata |
CONCUR
2001
Springer
13 years 12 months ago
2001
Springer
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
AMW
2011
12 years 11 months ago
2011
Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into aut...
QEST
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider bisimulation and weak bisimulation relations in the context of the Labeled Markov Chains of Hansson and Jonsson, the Concurrent Labeled Markov Chains of Philippou, Lee...
CAV
2012
Springer
11 years 10 months ago
2012
Springer
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, ...
FORMATS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...