113 citations · 260 across the 57 of their papers we have counts for
Showing 2013 · cs.LOShow all
2 papers · 2 filters
cs.LO2013
On the Complexity of Temporal-Logic Path Checking
Daniel Bundala, Joël Ouaknine
Given a formula in a temporal logic such as LTL or MTL, a fundamental problem is the complexity of evaluating the formula on a given finite word. For LTL, the complexity of this ta…
cs.LO2013★ 7 cited
A Static Analysis Framework for Livelock Freedom in CSP
Joel Ouaknine, Hristina Palikareva, A. W. Roscoe +1
In a process algebra with hiding and recursion it is possible to create processes which compute internally without ever communicating with their environment. Such processes are sai…