Well-structured transition systems (WSTS's) are a general class of infinite state systems for which decidability results rely on the existence of a well-quasi-ordering between states that is compatible with the transitions. In this article, we provide an extensive treatment of the WSTS idea and show several new results. Our improved definitions allow many examples of classical systems to be seen as instances of WSTS's. 1
|
2762
|
Communication and Concurrency
– Milner
- 1989
|
|
1393
|
A theory of timed automata
– Alur, Dill
- 1994
|
|
555
|
Petri Net Theory and the Modeling of Systems
– Peterson
- 1981
|
|
186
|
Graph rewriting: An algebraic and logic approach
– Courcelle
- 1990
|
|
168
|
Ordering by divisibility in abstract algebras
– Higman
- 1952
|
|
153
|
On communicating finite-state machines
– Brand, Zafiropulo
- 1983
|
|
127
|
B.: Verifying programs with unreliable channels
– Abdulla, Jonsson
- 1993
|
|
107
|
Characterizing finite Kripke structures in propositional temporal logic
– Browne, Clarke, et al.
- 1988
|
|
99
|
Parallel program schemata
– Karp, Miller
- 1969
|
|
98
|
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
– Baeten, Bergstra, et al.
- 1993
|
|
73
|
Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors
– Dickson
- 1913
|
|
64
|
Infinite results
– Moller
- 1996
|
|
55
|
General decidability theorems for infinite-state systems
– Abdulla, Cerans, et al.
- 1996
|
|
49
|
Unreliable channels are easier to verify than perfect channels
– Cécé, Finkel, et al.
- 1995
|
|
49
|
Hybrid automata with finite bisim-ulations
– Henzinger
- 1995
|
|
49
|
The theory of well-quasi-ordering: A frequently discovered concept
– Kruskal
- 1972
|
|
43
|
Context-free languages and pushdown automata
– AUTEBERT, BERSTEL, et al.
- 1997
|
|
35
|
Deciding bisimulation equivalences for a class of nonfinite-state programs
– Jonsson, Parrow
- 1993
|
|
25
|
Petri Nets: An Introduction., volume 4
– Reisig
- 1985
|
|
23
|
Reset Nets Between Decidability and Undecidability
– Schnoebelen
- 1998
|
|
23
|
Decidability of the termination problem for completely specificied protocols
– Finkel
- 1994
|
|
23
|
Self-modifying nets, a natural extension of Petri nets
– Valk
- 1978
|
|
22
|
Reduction and covering of infinite reachability trees
– Finkel
- 1990
|
|
21
|
Some decision problems related to the reachability problem for Petri nets
– Araki, Kasami
- 1977
|
|
17
|
More infinite results
– Esparza
- 1996
|
|
15
|
Algorithmic analysis of programs with well quasi-ordered domains
– Abdulla, Cerans, et al.
- 2000
|
|
14
|
A.: Programs with quasi-stable channels are effectively recognizable (extended abstract
– Cécé, Finkel
- 1997
|
|
10
|
Decidable subsets of CCS
– Christensen, Hirshfeld, et al.
- 1994
|
|
9
|
A new class of analyzable CFSMs with unbounded FIFO channels
– Finkel
- 1988
|
|
8
|
Deciding properties of integral relational automata
– Cerans
- 1994
|
|
7
|
Finite state description of communication protocols
– Bochmann
- 1978
|
|
7
|
nets with marking-dependent arc cardinality: properties and analysis
– Petri
- 1994
|
|
7
|
A model for recursive-parallel programs
– Schnoebelen
|
|
5
|
A generalization of the procedure of Karp and Miller to well structured transition systems
– Finkel
- 1987
|
|
5
|
A formal framework for the analysis of recursive-parallel programs
– Schnoebelen
- 1997
|
|
5
|
An introduction to FIFO nets-monogeneous nets: a subclass of FIFO nets
– Memmi, Finkel
- 1985
|
|
4
|
Fifo nets without order deadlock
– Finkel, Choquet
- 1988
|
|
4
|
Structuration des Systemes de Transitions --- Applications au Controle du Parallelisme par Files FIFO. These Science, Universite de Paris--Sud
– Finkel
- 1986
|
|
2
|
Branching time and abstraction in process algebra
– Glabbeek, Weijland
- 1989
|
|
1
|
Model-checking through constraint solving. In Methods and Tools for the Verification of Infinite State Systems
– Abdulla, Jonsson
|
|
1
|
Etat de l'art des techniques d'analyse des automates finis communicants. Rapport de DEA, Universit'e de Paris-Sud
– C'ec'e
- 1993
|
|
1
|
About monogeneous fifo Petri nets
– Finkel
- 1982
|
|
1
|
Well structured transition systems. Research Report 365, Lab. de Recherche en
– Finkel
- 1987
|
|
1
|
Synchronizable networks of communicating finite state machines. Unpublished manuscript
– Gouda, Rosier
- 1985
|
|
1
|
On permutative grammars generating context-free languages
– Makinen
- 1985
|
|
