On coherence properties in term rewriting models of concurrency

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

Volumn 1664 LNCS, Issue , 1999, Pages 478-493

  Noll, Thomas ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COHERENCE PROPERTIES; DESIGN LANGUAGES; DISTRIBUTED SYSTEMS; EQUATIONAL THEORY; REWRITING LOGIC; REWRITING MODULO; TRANSITION RULE; VERIFICATION TOOLS;

SEMANTICS;

EID: 0009952716     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48320-9_33     Document Type: Conference Paper

References (20)

1. F. Baader and J. Siekmann. Unification theory. In Handbook of Logic in Artificial Intelligence and Logic Programming, volume 2, pages 41-125. Oxford University Press, 1994.
2. J.A. Bergstra and J.W. Klop. Conditional rewrite rules: Confluence and termination. Journal of Computer and System Sciences, 32(3):323-326, 1986.
3. CafeOBJ home page. http://caraway.jaist.ac.jp/cafeobj/.
4. The Concurrency Factory. http://www.cs.sunysb.edu/~concurr/
5. The Edinburgh Concurrency Workbench. http://www.dcs.ed.ac.uk/home/cwb/
6. ELAN home page. http://www.loria.fr/ELAN/
7. H. Ganzinger. A completion procedure for conditional equations. Journal of Symbolic Computation, 11(1-2):51-82, 1991.
8. J.-P. Jouannaud and C. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal on Computing, 15(4):1155-1194, 1986.
9. The Maude system. http://maude.csl.sri.com/.
10. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73-155, April 1992.
11. J. Meseguer. Rewriting logic as a semantic framework for concurrency: a progress report. In Seventh International Conference on Concurrency Theory (CON-CUR'96), volume 1119 of Lecture Notes in Computer Science, pages 331-372. Springer-Verlag, August 1996.
12. R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice-Hall, 1989.
13. The Concurrency Workbench of North Carolina. http://www.csc.ncsu.edu/eos/ users/r/rance/WWW/cwb-nc.html.
14. The Process Algebra Compiler of North Carolina. http://www.csc.ncsu.edu/ eos/users/s/stsims/WWW/pac/pac-nc.html.
15. Model checking at CMU. http://www.cs.cmu.edu/~modelcheck/.
16. Spin. http://netlib.bell-labs.com/netlib/spin/whatispin.html.
17. Truth home page. http://www-i2.informatik.rwth-aachen.de/Forschung/MCS/ Truth/.
18. P. Viry. Rewriting: An effective model of concurrency. In Proceedings of PARLE'94-Parallel Architectures and Languages Europe, volume 817 of Lecture Notes in Computer Science, pages 648-660. Springer-Verlag, 1994.
19. P. Viry. Rewriting modulo a rewrite system. Technical Report TR-95-20, Università di Pisa, Dipartimento di Informatica, December 1995.
20. P. Viry. A rewriting implementation of pi{calculus. Technical Report TR-96-30, Università di Pisa, Dipartimento di Informatica, March 1996.