Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Cts systems and Petri nets
Aalbersberg I., Rozenberg G. (ed) Theoretical Computer Science40 (2-3):149-162,1985.Type:Article
Date Reviewed: Mar 1 1987

The motivation for, and certain terminology in, this paper depend on a previous paper by the second author [1], in which he introduced coordinated table selective substitution, or cts systems, which supposedly provide a unifying framework for various types of automata and grammars. A cts system is a kind of product of “sequential” grammars.

The main result of the present paper is that there is a certain subclass of cts systems that is equal to the class of labeled marked Petri nets. The authors state in the Introduction that they will “indicate how this relationship can be exploited to the advantage of both theories.” However, in the reviewer’s opinion, there is little evidence in this paper of how the theory of Petri nets benefits from this relationship.

Reviewer:  D. Bollman Review #: CR111058
1) Rozenberg, G.On coordinated selective substitution: towards a unified theory of grammars and machines, Theor. Comput. Sci. 37 (1985), 31–50.
Bookmark and Share
 
Grammar Types (F.4.2 ... )
 
 
Classes Defined By Grammars Or Automata (F.4.3 ... )
 
 
Unbounded-Action Devices (F.1.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Grammar Types": Date
Results on NLC grammars with one-letter terminal alphabets
Hoffmann J., Main M. Theoretical Computer Science 73(3): 279-294, 2001. Type: Article
Oct 1 1991
Recursive queries and context-free graph grammars
Courcelle B. Theoretical Computer Science 78(1): 217-244, 1991. Type: Article
Aug 1 1992
Attribute grammars : definitions, analysis of dependencies, proof methods
Courcelle B. (ed), Cambridge University Press, New York, NY, 1984. Type: Book (9780521268431)
Oct 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy