Decompositions of asynchronous systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1466, Issue , 1998, Pages 549-564

  Morin, Rémi ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; PETRI NETS;

ASYNCHRONOUS AUTOMATA; ASYNCHRONOUS SYSTEM; CONCURRENT SYSTEMS; GLOBAL REPRESENTATION; SYNTHESIS PROBLEMS; TRANSITION SYSTEM;

DECOMPOSITION;

EID: 84945930638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055647     Document Type: Conference Paper

References (18)

1. ARNOLD A., NIVAT M. (1982): Comportements de processus, Colloque AFCET, "Les Mathématiques de l’Informatique", p. 35-68
2. BADOUEL E., BERNARDINELLO L., DARONDEAU PH. (1997): The synthesis problem for elementary net systems is NP-complete, TCS 186, p. 107-134
3. BEDNARCZYK M.A. (1987): Categories o] Asynchronous Systems, thesis, University of Sussex
4. DUBOC C. (1986): Mixed product and asynchronous automata, TCS 48, p. 183-199
5. EHRENFEUCHT A., ROZENBERG G. (1990): Partial (Set) 2-structures, Part II State spaces of concurrent systems, Acta Informatica, Vol. 27, p. 343-368
6. GAREY M., JOHNSON D. (1978): Computers and intractability: a guide to the theory of NP-completeness, p. 194, W. H. Freeman and Company
7. GODEFROID P., WOLPER P. (1991): Using Partial Orders for Efficient Verification of Deadlock Freedom and Safety Properties, CAV, LNCS 575, p. 332-341
8. LYNCH, N.A. (1996): Distributed Algorithms, Morgan Kaufmann Publishers, Inc., San Francisco, California
9. MACLANE S. (1971): Categories for the Working Mathematician, Graduate Texts in Mathematics, Springer-Verlag
10. MUKUND M. (1992): Petri nets and step transition systems, International Journal of Foundations of Computer Science, Vol. 3, N. 4, p. 443-478
11. MUKUND M., NIELSEN M. (1992): CCS, Locations and Asynchronous Transition Systems, Report DAIMI, Vol. 3, N. 4, p. 443-478 and LNCS 652, p. 328-341
12. NIELSEN M., PLOTKIN G., WINSKEL G. (1981): Petri nets, events structures and domains, part 1, TCS 13, p. 85-108
13. NIELSEN M., ROZENBERG G., THIAGARAJAN P.S. (1992): Elementary transition systems, TCS 96, p. 3-33
14. PIGGHIZZlNI G. (1994): Asynchronous automata versus asynchronous cellular automata, TCS 132, p. 179-207
15. SHIELDS M.W. (1992): Muititraces, Hypertraces and Partial Order Semantics, Formal Aspects of Computing 4, p. 649-672
16. VALMARI A. (1990): A Stubborn Attack on State Explosion, CAV, LNCS 531, p. 156-165
17. WlNSKEL G., NIELSEN M. (1994): Models for Concurrency, Handbook of Logic in Computer Science, vol. 3, Oxford University Press, also available as Research Report DAIMI, PB-463, Aarhus University
18. ZIELONKA W. (1987): Notes on finite asynchronous automata, Theoretical Informatics and Applications, vol. 21, p. 99-135