The residue of vector sets with applications to decidability problems in Petri nets
From MaRDI portal
Publication:797285
DOI10.1007/BF00289715zbMATH Open0545.68051OpenAlexW2295768847MaRDI QIDQ797285FDOQ797285
Matthias Jantzen, Ruediger Valk
Publication date: 1985
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289715
Recommendations
- scientific article; zbMATH DE number 3992938
- Petri nets and semilinear sets (extended abstract)
- Entscheidbarkeit bei Petri Netzen
- scientific article; zbMATH DE number 1522994
- scientific article; zbMATH DE number 827979
- Petri nets and large finite sets
- Residuated frames with applications to decidability
- scientific article; zbMATH DE number 1302047
- scientific article
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)
Cites Work
- Parallel program schemata
- Rational sets in commutative monoids
- Title not available (Why is that?)
- The covering and boundedness problems for vector addition systems
- Petri nets and regular languages
- Decision problems forω-automata
- The equality problem for vector addition systems is undecidable
- Title not available (Why is that?)
- Safe states in banker-like resource allocation problems
- Title not available (Why is that?)
- Infinite behaviour of Petri nets
- 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?)
Cited In (27)
- Title not available (Why is that?)
- Constrained properties, semilinear systems, and Petri nets
- Residuated frames with applications to decidability
- Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks
- Title not available (Why is that?)
- Reachability solution characterization of parametric real-time systems
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings
- Safe states in banker-like resource allocation problems
- Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
- Linear control of live marked graphs
- On minimal elements of upward-closed sets
- Title not available (Why is that?)
- A taxonomy of fairness and temporal logic problems for Petri nets
- A well-structured framework for analysing Petri net extensions
- Problems concerning fairness and temporal logic for conflict-free Petri nets
- On computing the supremal right-closed control invariant subset of a right-closed set of markings for an arbitrary Petri net
- Resilience of well-structured graph transformation systems
- Title not available (Why is that?)
- On selective unboundedness of VASS
- Deciding a class of path formulas for conflict-free Petri nets
- ON YEN'S PATH LOGIC FOR PETRI NETS
- A unified approach for deciding the existence of certain petri net paths
- Optimal Bounds for Multiweighted and Parametrised Energy Games
- Computing Minimal Elements of Upward-Closed Sets for Petri Nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Controlling a random population
This page was built for publication: The residue of vector sets with applications to decidability problems in Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797285)
