Skip to Main content Skip to Navigation
Reports

From bounded T-systems to 1-safe T-systemsup to language equivalence

Philippe Darondeau 1 Harro Wimmel 2
1 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : We show that every finite and bounded marked graph or T-system has a 1-safe labelled version with an identical language.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00071878
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:04:28 PM
Last modification on : Thursday, January 7, 2021 - 4:28:46 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:42:35 PM

Identifiers

  • HAL Id : inria-00071878, version 1

Citation

Philippe Darondeau, Harro Wimmel. From bounded T-systems to 1-safe T-systemsup to language equivalence. [Research Report] RR-4708, INRIA. 2003. ⟨inria-00071878⟩

Share

Metrics

Record views

270

Files downloads

403