232 search results - page 31 / 47 » Termination of linear bounded term rewriting systems |
66
Voted
PODC
2010
ACM
15 years 3 months ago
2010
ACM
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
ATAL
2009
Springer
15 years 5 months ago
2009
Springer
We develop a tableau-based decision procedure for the full coalitional multiagent temporal-epistemic logic of linear time CMATEL(CD+LT). It extends LTL with operators of common an...
RTA
2007
Springer
15 years 5 months ago
2007
Springer
In the analysis of cryptographic protocols, a treacherous set of terms is one from which an intruder can get access to what was intended to be secret, by adding on to the top of a ...
SIGSOFT
2007
ACM
15 years 12 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— In this paper, a new method to design an observer for nonlinear systems described by Takagi-Sugeno (TS) model, with unmeasurable premise variables, is proposed. Most of existin...