From bounded T-systems to 1-safe T-systemsup to language equivalenceReport as inadecuate




From bounded T-systems to 1-safe T-systemsup to language equivalence - Download this document for free, or read online. Document in PDF available to download.

1 S4 - System synthesis and supervision, scenarios IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique 2 Fachbereich Informatik - Oldenburg

Abstract : We show that every finite and bounded marked graph or T-system has a 1-safe labelled version with an identical language.

Keywords : PERMUTATIONS LABELLING ARNOLD-NIVAT PRODUCT CIRCUITS SEQUENTIAL COMPONENTS T-SYSTEMS MARKED GRAPHS PETRI NETS





Author: Philippe Darondeau - Harro Wimmel -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents