Minimal generating sets for semiflows
From MaRDI portal
Publication:6535470
DOI10.1007/978-3-031-35355-0_12zbMATH Open1543.68225MaRDI QIDQ6535470
Publication date: 11 January 2024
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nets, time and space
- Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
- Ein Satz über Untermengen einer endlichen Menge.
- Conditions for extinction events in chemical reaction networks with discrete state spaces
- How Petri net theory serves Petri net model checking: a survey
- Structural Place Invariants for Analyzing the Behavioral Properties of Nested Petri Nets
- P-Semiflow Computation with Decision Diagrams
- Using linear programming in Petri net analysis
- On liveness and controlled siphons in Petri nets
- Structural Invariants for the Verification of Systems with Parameterized Architectures
This page was built for publication: Minimal generating sets for semiflows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535470)
