journal contribution
posted on 2007-07-01, 00:00 authored by Iliano CervesatoIliano Cervesato, Frank Pfenning, Jorge Luis Sacchini, Carsten Schurmann, Robert J. Simmons<p>Concurrent traces are sequences of computational steps where independent steps can be permuted and executed in any order. We study the problem of matching on concurrent traces. We outline a sound and complete algorithm for matching traces with one variable standing for an unknown subtrace.</p>