Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis

DOI10.3233/FI-2021-2080OpenAlexW3208987153MaRDI QIDQ5025057

Raymond Devillers

Publication date: 1 February 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.00202

zbMATH Keywords

decompositioncompositionlabelled transition systemsPetri net synthesis

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• SMTInterpol
• Algorithm 447
• APT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Petri net synthesis
• Maintaining bridge-connected and biconnected components on-line
• The synthesis problem for elementary net systems is NP-complete
• Over-approximative Petri net synthesis for restricted subclasses of nets
• Factorisation of transition systems
• Bounded choice-free Petri net synthesis: algorithmic issues
• The box algebra = Petri nets + process expressions
• The synthesis problem of Petri nets
• Factorisation of Petri net solvable transition systems
• Interpolating Quantifier-Free Presburger Arithmetic
• Polynomial algorithms for the synthesis of bounded nets
• A New Property of Choice-Free Petri Net Systems
• Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
• Articulation of Transition Systems and Its Application to Petri Net Synthesis
• Hardness Results for the Synthesis of b-bounded Petri Nets

This page was built for publication: Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis