State space axioms for T-systems (Q2340253)

From MaRDI portal
Revision as of 06:45, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
State space axioms for T-systems
scientific article

    Statements

    State space axioms for T-systems (English)
    0 references
    0 references
    0 references
    16 April 2015
    0 references
    The authors define T-systems as Petri nets without forward or backward branching places. In contrast to marked graphs, places without input- or output-transitions are allowed. The paper characterises (finite or infinite) labelled transition systems which are isomorphic to state spaces of T-systems and provides synthesis algorithms for T-systems from labelled transition systems satisfying the characterising properties.
    0 references
    0 references
    T-systems
    0 references
    Petri nets
    0 references
    marked graphs
    0 references
    synthesis
    0 references
    labelled transition systems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references