73 search results - page 7 / 15 » Products of Tree Automata with an Application to Temporal Lo... |
FM
2003
Springer
14 years 25 days ago
2003
Springer
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
CONCUR
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
ENTCS
2007
13 years 7 months ago
2007
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...