The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calcul...
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van...
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rul...
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
: The specification of the dynamic behaviour of reactive distributed systems must exhibit the structures of control and has to imply explicitly the relevant aspects of the distribu...