Fundamental Structures in Well-Structured Infinite Transition Systems

We suggest a simple and clean definition for Well-Structured Transition Systems [20, 1], a general class of infinite state systems for which decidability results exist. As a consequence we can (1) generalize the definition in many ways, (2) find examples of (general) WSTS's in many fields, and (3) present new decidability results.

[1]  Faron Moller,et al.  Infinite Results , 1996, CONCUR.

[2]  Alain Finkel,et al.  Unreliable Channels are Easier to Verify Than Perfect Channels , 1996, Inf. Comput..

[3]  Rüdiger Valk,et al.  The residue of vector sets with applications to decidability problems in Petri nets , 1985, Acta Informatica.

[4]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[5]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[6]  Alain Finkel,et al.  Reduction and covering of infinite reachability trees , 1990, Inf. Comput..

[7]  Alain Finkel,et al.  A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems , 1987, ICALP.

[8]  Parosh Aziz Abdulla,et al.  Verifying programs with unreliable channels , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[9]  Søren Christensen,et al.  A General Systematic Approach to Arc Extensions for Coloured Petri Nets , 1994, Application and Theory of Petri Nets.

[10]  A. Finkel,et al.  Fifo nets without order deadlock , 1988 .

[11]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[12]  Jan A. Bergstra,et al.  Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages , 1987, PARLE.

[13]  Rüdiger Valk.  Self-Modifying Nets, a Natural Extension of Petri Nets , 1978, ICALP.

[14]  Gianfranco Ciardo,et al.  Petri Nets with Marking-Dependent Ar Cardinality: Properties and Analysis , 1994, Application and Theory of Petri Nets.

[15]  Karlis Cerans,et al.  Deciding Properties of Integral Relational Automata , 1994, ICALP.

[16]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[17]  Søren Christensen.  Decidability and decomposition in process algebras , 1993 .

[18]  Philippe Schnoebelen,et al.  A model for recursive-parallel programs , 1996, INFINITY.

[19]  Gregor von Bochmann,et al.  Finite State Description of Communication Protocols , 1978, Comput. Networks.

[20]  Mohamed G. Gouda,et al.  Priority Networks of Communicating Finite State Machines , 1985, SIAM J. Comput..

[21]  Erkki Mäkinen.  On permutative grammars generating context-free languages , 1985, BIT Comput. Sci. Sect..

[22]  J. Esparza.  More Innnite Results , 1996 .

[23]  Alain Finkel,et al.  The Minimal Coverability Graph for Petri Nets , 1991, Applications and Theory of Petri Nets.