Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable (Q2117174): Difference between revisions

@@ Property / describes a project that uses @@
+APT
@@ Property / describes a project that uses: APT / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-76983-3_13
+Normal rank
@@ Property / OpenAlex ID @@
+W3172765973
@@ Property / OpenAlex ID: W3172765973 / rank @@
+Normal rank
@@ Property / cites work @@
+Process Mining
@@ Property / cites work: Process Mining / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for the synthesis of bounded nets
+Normal rank
@@ Property / cites work @@
+Petri net synthesis
@@ Property / cites work: Petri net synthesis / rank @@
+Normal rank
@@ Property / cites work @@
+Distributing finite automata through Petri net synthesis
+Normal rank
@@ Property / cites work @@
+Petri Net Distributability
@@ Property / cites work: Petri Net Distributability / rank @@
+Normal rank
@@ Property / cites work @@
+Synthesis and reengineering of persistent systems
@@ Property / cites work: Synthesis and reengineering of persistent systems / rank @@
+Normal rank
@@ Property / cites work @@
+The Label Splitting Problem
@@ Property / cites work: The Label Splitting Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Logic Synthesis for Asynchronous Controllers and Interfaces
+Normal rank
@@ Property / cites work @@
+Relabelling LTS for Petri net synthesis via solving separation problems
+Normal rank