• Citer

State space axioms for T-systems

par Devillers, Raymond ;Best, Eike
Référence Acta informatica, 52, 2-3, page (133--152)
Publication Publié, 2015

Article révisé par les pairs

• Détails
• Contenu

Résumé :

T-systems are generalisations of marked graph Petri nets. This paper describes synthesis algorithms that allow bounded or unbounded T-systems to be derived from finite or infinite labelled transition systems satisfying a set of necessary properties. These properties can thus be interpreted as axioms characterising T-system state spaces.