Discovering thread interactions in a concurrent system

Author(s):  
J.E. Cook ◽  
Zhidian Du
Keyword(s):  
1981 ◽  
Vol 4 (3) ◽  
pp. 531-549 ◽  
Author(s):  
Miklós Szijártó

The correspondence between sequential program schemes and formal languages is well known (Blikle and Mazurkiewicz (1972), Engelfriet (1974)). The situation is more complicated in the case of parallel program schemes, and trace languages (Mazurkiewicz (1977)) have been introduced to describe them. We introduce the concept of the closure of a language on a so called independence relation on the alphabet of the language, and formulate several theorems about them and the trace languages. We investigate the closedness properties of Chomsky classes under closure on independence relations, and as a special case we derive a new necessary and sufficient condition for the regularity of the commutative closure of a language.


Author(s):  
Laurent Georget ◽  
Mathieu Jaume ◽  
Guillaume Piolle ◽  
Frédéric Tronel ◽  
Valérie Viet Triem Tong

1990 ◽  
Vol 15 (2-3) ◽  
pp. 258-259
Author(s):  
Trevor P. Hopkins

2011 ◽  
pp. 239-268 ◽  
Author(s):  
Krzysztof Pancerz ◽  
Zbigniew Suraj

This chapter constitutes the continuation of a new research trend binding rough set theory with concurrency theory. In general, this trend concerns the following problems: discovering concurrent system models from experimental data represented by information systems, dynamic information systems or specialized matrices, a use of rough set methods for extracting knowledge from data, a use of rules for describing system behaviors, and modeling and analyzing of concurrent systems by means of Petri nets on the basis of extracted rules. Some automatized methods of discovering concurrent system models from data tables are presented. Data tables are created on the basis of observations or specifications of process behaviors in the modeled systems. Proposed methods are based on rough set theory and colored Petri net theory.


Sign in / Sign up

Export Citation Format

Share Document