@article {LV09b,
	title = {The tccp Interpreter},
	journal = {Electronic Notes in Theoretical Computer Science},
	volume = {258},
	number = {1},
	year = {2009},
	pages = {63{\textendash}77},
	abstract = {The Timed Concurrent Constraint Language (tccp in short) is a constraint-based concurrent language inspired in process algebra. The language is well-suited for the specification of concurrent and reactive systems. tccp is parametric w.r.t. a constraint system, what is a main characteristic of the Concurrent Constraint Paradigm of Saraswat. Maude is an executable rewriting logic language specially well suited for the specification of distributed systems. The tccpInterpreter system is the result of implementing the tccp language (the constraint system, agents and semantics) in Maude. It parses the program and mimics in an automatic way its behavior allowing us to use the Maude features to execute and analyze tccp programs.},
	author = {Lescaylle, A. and Alicia Villanueva}
}
