Well-structured transition systems everywhere!
By A. Finkel, P. Schnoebelen. Theoretical Computer Science, 2001
741 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/284b7897abe8bb6bd724436d464ccf67ee437833
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Wil M.P. van der Aalst
- H. Verbeek
- A. T. Hofstede
- Jiri Srba
- Minseok Song
- Manfred Reichert
- Bernd Weber
- Boudewijn van Dongen
In Computational Theory and Mathematics
- Wil M.P. van der Aalst
- A. T. Hofstede
- H. Verbeek
- Kees van Hee
- Natalia V. Sidorova
- Marc Voorhoeve
- Moe Thandar Wynn
- Jiri Srba
Citations in the corpus
- Soundness of workflow nets: classification, decidability, and analysis (2011, background): “This is possible because coverability is decidable for reset nets [DFS98, FS01] and therefore it is possible to check for each transition t whether • t is coverable from the initial marking (see also the proof of Theorem 6.1).”
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (2008, background): “These results hold due to the monotonicity property (adding more tokens to the net does not restrict the possible executions) and the application of well-quasi-ordering (for a general introduction see [48]) resp.”