Frank Valencia’s main interests are within Formal Methods in Computer Science, in particular Concurrency Theory, Logic and Constraint-based Formalisms. He has published results on the computational expressiveness of well-stablished process calculi such as CCS (Calculus of Communicating Systems), the π-calculus and CCP (Concurrent Constraint Programming). In particular, he has given expressiveness distinctions between dynamic and static scope as well as replication and recursion in CCS and CCP, a Chomsky-like hierarchy of fragments of CCS, separation results for linear and persistent fragments of the π-calculus, and the Büchi-automata characterization of timed CCP. Frank Valencia has established new connections between the areas of concurrency theory and logic by providing first-order, temporal and epistemic logic interpretations of concurrent phenomena such as mobile, timed, spatial behavior. He has used these connections to prove new results in these areas such as the decidability of the observational equivalence for several fragments of the π-calculus and the decidability of satisfiability for the existential fragment of first-order temporal logic. He has been one of the originators of constraint-based process calculi for analyzing timed, mobile, spatial and epistemic behavior in concurrent systems. Over a decade ago he published work on search and consistency algorithms for CSP (Constraint Satisfaction Problems), and introduced the notion of Infinite (or unbounded) CSP.
As of 2016, Frank Valencia has published over 50 articles in international peer-reviewed venues with around a thousand citations. He has the following currently sponsored research projects (2016):
From 2014 to July 2016 Frank has published the following works.
At International Peer-Reviewed Journals and Conferences.
Book Scientific Edition