In the process-algebraic veri cation of systems with three or more components put in parallel, alphabet axioms are considered to be very useful. These are rules that exploit the i...
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
Many tasks within semantic web service discovery can be formalized as reasoning problems related to the partial ordering of subactivity occurrences in a complex activity. We show h...
Swarm is a computational model which extends the UNITY model in three important ways: (1) UNITY’s fixed set of variables is replaced by an unbounded set of tuples which are add...