Abstract. We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the de...
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
This short paper explores the potential of embedding-based graph rewriting as a tool for understanding natural computing, and in particular self-assembly. The basic point of view i...
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain ...