Factorisation of Petri net solvable transition systems

DOI10.1007/978-3-319-91268-4_5MaRDI QIDQ2280180zbMATH OpenOpenAlexFDO

Authors Raymond Devillers, Uli Schlachter

Publication date 18 December 2019

Full work available at URL https://doi.org/10.1007/978-3-319-91268-4_5

zbMATH Keywords

compositiondecompositionlabelled transition systemsPetri net synthesis

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Factorisation of transition systems
• Decomposition of Petri nets
• Factorization properties of symbolic unfoldings of colored Petri nets
• PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
• Deriving Petri nets from finite transition systems
• scientific article; zbMATH DE number 1973122
• Decompositional Petri Net Reductions
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Analysis of Petri nets and transition systems
• scientific article; zbMATH DE number 1555184

Cited in

(5)

• Factorisation of transition systems
• Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
• Target-oriented Petri net synthesis
• Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
• Articulation of Transition Systems and Its Application to Petri Net Synthesis

This page was built for publication: Factorisation of Petri net solvable transition systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280180)