- AutorIn
- Igor V. Tarasyuk
- Titel
- Tau-Equivalences and Refinement for Petri Nets Based Design
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa-100370
- Schriftenreihe
- Technische Berichte
- Bandnummer
- 2000,11 (TUD-FI00-11 November 2000)
- Erstveröffentlichung
- 2000
- ISSN
- 1430-211X
- Abstract (EN)
- The paper is devoted to the investigation of behavioral equivalences of concurrent systems modeled by Petri nets with silent transitions. Basic τ-equivalences and back-forth τ-bisimulation equivalences known from the literature are supplemented by new ones, giving rise to complete set of equivalence notions in interleaving / true concurrency and linear / branching time semantcis. Their interrelations are examined for the general class of nets as well as for their subclasses of nets without siltent transitions and sequential nets (nets without concurrent transitions). In addition, the preservation of all the equivalence notions by refinements (allowing one to consider the systems to be modeled on a lower abstraction levels) is investigated.
- Freie Schlagwörter (DE)
- Petri-Netze, sequentielle Netze
- Freie Schlagwörter (EN)
- Petri nets with and without silent transitions, sequential nets, basic τ-equivalences, tau-equivalences, back-forth τ-equivalences, refinement
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- SS 5514
- Publizierende Institution
- Technische Universität Dresden, Dresden
- Förder- / Projektangaben
- Sonstige beteiligte Institution
- Russian Academy of Sciences, Novosibirsk, Russland
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa-100370
- Veröffentlichungsdatum Qucosa
- 27.11.2012
- Dokumenttyp
- Forschungsbericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis