17 search results - page 1 / 4 » A decidable characterization of the classes between lintime ... |
86
Voted
IPL
2006
14 years 9 months ago
2006
A language is defined by closure under safe iteration and under a new form of safe diagonalization that, unlike other forms of diagonalization used in literature to define sub-recu...
LPAR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
ICALP
1999
Springer
15 years 1 months ago
1999
Springer
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
FOSSACS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Spatial logics have been introduced to reason about distributed computation in models for concurrency. We first define a spatial logic for a general class of infinite-...
APAL
2007
14 years 9 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...