54 search results - page 8 / 11 » Proving operational termination of membership equational pro... |
JCSS
2010
13 years 6 months ago
2010
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
HYBRID
2010
Springer
14 years 2 months ago
2010
Springer
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
HYBRID
2010
Springer
14 years 2 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
SP
2010
IEEE
13 years 5 months ago
2010
IEEE
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...
HYBRID
1997
Springer
13 years 11 months ago
1997
Springer
Hybrid transition systems in their full generality describe continuous behaviour by a set of equations in each mode an algebraic or di erential equation for each state variable in ...