73 search results - page 3 / 15 » Products of Tree Automata with an Application to Temporal Lo... |
ASWEC
2007
IEEE
14 years 1 months ago
2007
IEEE
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...
ASIAN
2003
Springer
14 years 25 days ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
JVA
2006
IEEE
14 years 1 months ago
2006
IEEE
We present a natural deduction calculus for the computation tree logic CTL defined with the full set of classical and temporal logic operators. The system extends the natural ded...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...