Rewrite systems with constraints

Electronic Notes in Theoretical Computer Science

Volumn 52, Issue 1, 2002, Pages 46-65

  Strejček, Jan ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTER SIMULATION; CONCURRENT ENGINEERING; CONSTRAINT THEORY; LINEAR ALGEBRA; SET THEORY;

BASIC PARALLEL PROCESSES (BPP); CONCURRENT CONSTRAINT PROGRAMMING (CCP); PROCESS REWRITE SYSTEMS (PRS); REWRITE SYSTEMS;

PARALLEL PROCESSING SYSTEMS;

EID: 18944366868     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00216-6     Document Type: Conference Paper

References (15)

1. Bergstra J.A., Klop J.W. Algebra of communicating processes with abstraction. Theoretical Computer Science. 37:1985;77-121
2. Burkart O., D. Caucal, and B. Steffen, Bisimulation collapse and the process taxonomy, Proceedings of CONCUR '96, Lecture Notes in Computer Science, vol. 1119, Springer-Verlag, 1996, 247-262.
3. Burkart O., Esparza J. More infinite results. Bulletin of the European Association for Theoretical Computer Science. 62:1997;138-159
4. Caucal D. On the regular structure of prefix rewriting. Theoretical Computer Science. 106:1992;61-86
5. Christensen S., "Decidability and Decomposition in Process Algebras," Ph.D. thesis, Department of Computer Science, University of Edinburgh, 1993.
6. Groote J.F., Vaandrager F. Structured operational semantics and bisimulation as a congruence. Information and Computation. 100:(2):1992;202-260
7. Mayr R., Combining Petri nets and PA-processes, Proceedings of TACS '97, Lecture Notes in Computer Science, vol. 1281, Springer-Verlag, 1997, 547-561.
8. Mayr R., Process rewrite systems, Electronic Notes in Theoretical Computer Science 7 (1997).
9. Milner R., "A calculus on communicating systems," Lecture Notes in Computer Science, vol. 92, Springer-Verlag, 1980.
10. Milner R. "Communication and Concurrency," 1989;Prentice Hall
11. Moller F., Infinite results, Proceedings of CONCUR '96, Lecture Notes in Computer Science, vol. 1119, Springer-Verlag, 1996, 195-216.
12. Moller F., A taxonomy of infinite state processes, Electronic Notes in Theoretical Computer Science 18 (1998).
13. Park, D. M. R., Concurrency and automata on infinite sequences, Theoretical Computer Science: 5th GI-Conference, Lecture Notes in Computer Science, vol. 104, Springer-Verlag, 1981, 167-183.
14. Saraswat, V. A., "Concurrent Constraint Programming Languages," Ph.D. thesis, Computer Science Department, Carnegie Mellon University, 1989.
15. Strejček J., Constrained rewrite transition systems, Technical Report FIMU RS-2000-12, Faculty of Informatics, Masaryk University Brno, 2000, URL: http://www.fi.muni.cz/informatics/reports/.