scientific article; zbMATH DE number 7204383

DOI10.4230/LIPICS.MFCS.2017.49MaRDI QIDQ5111264zbMATH OpenFDO

Authors Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, Prakash Saivasan

Publication date 26 May 2020

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

zbMATH Keywords

Petri netsdownward closureupward closureBPP nets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The downward-closure of Petri net languages
• The complexity of downward closure comparisons
• Computing Minimal Elements of Upward-Closed Sets for Petri Nets
• On the regularity of Petri net languages

Cites work

• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 1059894 (Why is no real title available?)
• scientific article; zbMATH DE number 10087 (Why is no real title available?)
• scientific article; zbMATH DE number 827979 (Why is no real title available?)
• scientific article; zbMATH DE number 7204383 (Why is no real title available?)
• A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness
• A structure to decide reachability in Petri nets
• An Algorithm for the General Petri Net Reachability Problem
• An approach to computing downward closures
• Automated Deduction – CADE-20
• Comparing the Expressive Power of Well-Structured Transition Systems
• Complexity of Subcases of Presburger Arithmetic
• Computing downward closures for stacked counter automata
• Context-bounded analysis for concurrent programs with dynamic creation of threads
• Effective constructions in well-partially-ordered free monoids
• Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
• More on the Size of Higman-Haines Sets: Effective Constructions
• On Context-Free Languages
• On bounded reachability analysis of shared memory systems
• On free monoids partially ordered by embedding
• On selective unboundedness of VASS
• On the Reachability Analysis of Acyclic Networks of Pushdown Systems
• On the \(\omega\)-language expressive power of extended Petri nets
• On the context-freeness problem for vector addition systems
• Ordering by Divisibility in Abstract Algebras
• Parallel program schemata
• Petri nets and regular languages
• Petri nets and regular processes
• Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable
• The Complexity of the Finite Containment Problem for Petri Nets
• The complexity of downward closure comparisons
• The complexity of regular abstractions of one-counter languages
• The context-freeness of the languages associated with vector addition systems is decidable
• The covering and boundedness problems for branching vector addition systems
• The covering and boundedness problems for vector addition systems
• The diagonal problem for higher-order recursion schemes is decidable
• The downward-closure of Petri net languages
• Unboundedness and downward closures of higher-order pushdown automata
• Undecidable problems in unreliable computations.
• Using forward reachability analysis for verification of lossy channel systems
• Vector addition system reachability problem, a short self-contained proof

Cited in

(7)

• Computing Minimal Elements of Upward-Closed Sets for Petri Nets
• scientific article; zbMATH DE number 7204383 (Why is no real title available?)
• Existential Definability over the Subword Ordering
• On minimal elements of upward-closed sets
• The complexity of downward closure comparisons
• Approximating Petri net reachability along context-free traces
• The downward-closure of Petri net languages

This page was built for publication:

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