499 search results - page 52 / 100 » LTL satisfiability checking |
121
click to vote
FMCO
2005
Springer
15 years 8 months ago
2005
Springer
We present a method for decomposing modal formulas for processes with the internal action τ. To decide whether a process algebra term satisfies a modal formula, one can check whe...
121
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partiti...
112
click to vote
IJISEC
2008
15 years 2 months ago
2008
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
142
click to vote
TOPNOC
2008
15 years 2 months ago
2008
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...
123
click to vote
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
One of the advantages of temporal-logic model-checking tools is their ability to accompany a negative answer to the correctness query by a counterexample to the satisfaction of the...