Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
422895 | Electronic Notes in Theoretical Computer Science | 2013 | 14 Pages |
Abstract
We show that history-preserving bisimilarity for higher-dimensional automata has a simple characterization directly in terms of higher-dimensional transitions. This implies that it is decidable for finite higher-dimensional automata. To arrive at our characterization, we apply the open-maps framework of Joyal, Nielsen and Winskel in the category of unfoldings of precubical sets.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics