1 December 2010 in The Bulletin of Symbolic Logic
In this paper, we give a step by step introduction to the theory ofwell quasi-orderedtransition systems. The framework combines two concepts, namely (i) transition systems which aremonotonicwrt. awell-quasi ordering; and (ii) a scheme for symbolicbackwardreachability analysis. We describe several models with infinite-state spaces, which can be analyzed within the framework, e.g., Petri nets, lossy channel systems, timed automata, timed Petri nets, and multiset rewriting systems. We will also presentbetter quasi-orderedtransition systems which allow the design of efficient symbolic representations of infinite sets of states.
7 December 2011 in International Journal on Software Tools for Technology Transfer
7 July 2016 in Acta Informatica
24 June 2016 in International Journal on Software Tools for Technology Transfer