A generalization of the procedure of karp and miller to well structured transition systems-Reference-Cited by-同舟云学术

A generalization of the procedure of karp and miller to well structured transition systems

Published:1987 Issue: Volume: Page:499-508
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Finkel Alain

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-18088-5_43.pdf

Reference20 articles.

1. G. Birkhoff "Lattice theory" AMS Publ., Providence (3rd ed. 1967).

2. G.W. Brams "Réseaux de Petri: theorie et pratique" T.1. Edition Masson (1983).

3. A. Choquet and A. Finkel "Simulation of linear Fifo nets by a new class of Petri nets" Rapport LRI no324, Univ. Paris 11, Orsay (January 1987).

4. L.E. Dickson "Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors", Amer. J. Math. 35 pp.413–422 (1913).

5. A. Finkel "Structuration des systèmes de transitions: applications au contrôle du parallélisme par files Fifo" Thèse d'Etat Université d'Orsay (17 June 1986).

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Verifying Unboundedness via Amalgamation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. FlashFill++: Scaling Programming by Example by Cutting to the Chase;Proceedings of the ACM on Programming Languages;2023-01-09

3. Model Checking for Collaborativeness;Petri Nets for Modeling of Large Discrete Systems;2021

4. From Well Structured Transition Systems to Program Verification;Electronic Proceedings in Theoretical Computer Science;2020-08-07

5. Forward analysis for WSTS, part I: completions;Mathematical Structures in Computer Science;2020-08