In: Report TUM-19112, Institut für Informatik, TU München, pages 1-33. 1991.
Also in: Kuich, W.: Lecture Notes in Computer Science, Vol. 623; Automata, Languages and Programming, 19th International Colloquium, ICALP'92, Vienna, Austria, July 13-17, 1992, pages 605-616. Springer-Verlag, 1992.
Abstract: In this paper we study nets whose boundaries in a context consist of places only, i.e. nets that communicate asynchronously with their environment. Such nets are called equivalent, if exchanging them in any context preserves deadlock-freeness. We characterize this equivalence internally, i.e. without referring to any contexts. Then we define a subclass of nets that are to some degree deterministic, and show that for them the exchange of equivalent nets gives bisimilar nets and that the equivalence is decidable here. Our results especially apply to the behaviour preserving refinement of transitions.