Characterisation of the state spaces of marked graph Petri nets
Autor: | Raymond Devillers, Eike Best |
---|---|
Rok vydání: | 2017 |
Předmět: |
Discrete mathematics
Marked graph Structure (category theory) 0102 computer and information sciences 02 engineering and technology State (functional analysis) Petri net Net (mathematics) 01 natural sciences Computer Science Applications Theoretical Computer Science Combinatorics Computational Theory and Mathematics 010201 computation theory & mathematics Reachability Transition system 0202 electrical engineering electronic engineering information engineering Graph (abstract data type) 020201 artificial intelligence & image processing Information Systems Mathematics |
Zdroj: | Information and Computation. 253:399-410 |
ISSN: | 0890-5401 |
Popis: | The structure of the reachability graph of a marked graph Petri net is fully characterised. Exact structural conditions are given for a given labelled transition system to be generated by a marked graph. Two cases are distinguished, corresponding to the boundedness or the unboundedness of the net, and, respectively, to the finiteness or the infiniteness of the transition system. Dedicated synthesis procedures are presented for both cases, and it is shown that there is always a unique minimal solution. The synthesis procedures allow this minimal net, its initial marking, and the marking bounds of its places to be computed from the labelled transition system. |
Databáze: | OpenAIRE |
Externí odkaz: |