Mukund, Madhavan (2002) Hereditary history preserving bisimulation is decidable for trace-labelled systems In: 22nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FST TCS 2002), 12-14 Dec 2002, Kanpur, India.
Full text not available from this repository.
Official URL: https://link.springer.com/chapter/10.1007%2F3-540-...
Related URL: http://dx.doi.org/10.1007/3-540-36206-1_26
Abstract
Hereditary history preserving bisimulation is a natural extension of bisimulation to the setting of so-called “true” concurrency. Somewhat surprisingly, this extension turns out to be undecidable, in general, for finite-state concurrent systems. In this paper, we show that for a substantial and useful class of finite-state concurrent systems - those whose semantics can be described in terms of Mazurkiewicz traces - hereditary history preserving is decidable.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Springer-Verlag. |
| Keywords: | Partial Order; Concurrent System; Reachable Marking; Springer LNCS; Asynchronous Automaton |
| ID Code: | 114208 |
| Deposited On: | 25 May 2018 04:53 |
| Last Modified: | 25 May 2018 04:53 |
Repository Staff Only: item control page
