From bounded T-systems to 1-safe T-systemsup to language equivalenceReportar como inadecuado




From bounded T-systems to 1-safe T-systemsup to language equivalence - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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





Autor: Philippe Darondeau - Harro Wimmel -

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



DESCARGAR PDF




Documentos relacionados