13 search results - page 1 / 3 » A Formal Axiomatization for Alphabet Reasoning with Parametr... |
FAC
1998
13 years 4 months ago
1998
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...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
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...
LATA
2010
Springer
13 years 8 months ago
2010
Springer
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...
ASWC
2009
Springer
13 years 8 months ago
2009
Springer
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...
HLPPP
1991
13 years 8 months ago
1991
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...