Translator Disclaimer
December 2010 Well (and better) quasi-ordered transition systems
Parosh Aziz Abdulla
Bull. Symbolic Logic 16(4): 457-515 (December 2010). DOI: 10.2178/bsl/1294171129

Abstract

In this paper, we give a step by step introduction to the theory of well quasi-ordered transition systems. The framework combines two concepts, namely (i) transition systems which are monotonic wrt. a well-quasi ordering; and (ii) a scheme for symbolic backward reachability 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 present better quasi-ordered transition systems which allow the design of efficient symbolic representations of infinite sets of states.

Citation

Download Citation

Parosh Aziz Abdulla. "Well (and better) quasi-ordered transition systems." Bull. Symbolic Logic 16 (4) 457 - 515, December 2010. https://doi.org/10.2178/bsl/1294171129

Information

Published: December 2010
First available in Project Euclid: 4 January 2011

zbMATH: 1207.68219
MathSciNet: MR2724530
Digital Object Identifier: 10.2178/bsl/1294171129

Rights: Copyright © 2010 Association for Symbolic Logic

JOURNAL ARTICLE
59 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.16 • No. 4 • December 2010
Back to Top