Affordable Access

Publisher Website

Semantic Reachability

Authors
Journal
Electronic Notes in Theoretical Computer Science
1571-0661
Publisher
Elsevier
Publication Date
Volume
5
Identifiers
DOI: 10.1016/s1571-0661(05)80679-6
Disciplines
  • Linguistics
  • Mathematics

Abstract

Abstract This paper is an approach to combine the reachability problem with semantic notions like bisimulation equivalence. It deals with questions of the following form: Is there a reachable state that is bisimulation equivalent to a given state ? Here we show some decidability results for process algebras and Petri nets.

There are no comments yet on this publication. Be the first to share your thoughts.