scientific article; zbMATH DE number 7204383

DOI10.4230/LIPICS.MFCS.2017.49zbMATH Open1441.68142arXiv1701.02927MaRDI QIDQ5111264FDOQ5111264

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

Publication date: 26 May 2020

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

Title of this publication is not available (Why is that?)

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)

Cites Work

• Parallel program schemata
• The Complexity of the Finite Containment Problem for Petri Nets
• On Context-Free Languages
• Title not available (Why is that?)
• Undecidable problems in unreliable computations.
• The covering and boundedness problems for vector addition systems
• Using forward reachability analysis for verification of lossy channel systems
• A structure to decide reachability in Petri nets
• Vector addition system reachability problem
• Petri nets and regular languages
• On selective unboundedness of VASS
• An Algorithm for the General Petri Net Reachability Problem
• Ordering by Divisibility in Abstract Algebras
• Title not available (Why is that?)
• Automated Deduction – CADE-20
• On free monoids partially ordered by embedding
• Title not available (Why is that?)
• Effective constructions in well-partially-ordered free monoids
• Title not available (Why is that?)
• Comparing the Expressive Power of Well-Structured Transition Systems
• Title not available (Why is that?)
• Complexity of Subcases of Presburger Arithmetic
• Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity
• Computing Downward Closures for Stacked Counter Automata
• The Downward-Closure of Petri Net Languages
• Petri nets and regular processes
• The context-freeness of the languages associated with vector addition systems is decidable
• The complexity of regular abstractions of one-counter languages
• Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
• The covering and boundedness problems for branching vector addition systems
• On the Reachability Analysis of Acyclic Networks of Pushdown Systems
• Unboundedness and downward closures of higher-order pushdown automata
• An Approach to Computing Downward Closures
• The Diagonal Problem for Higher-Order Recursion Schemes is Decidable
• Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable
• On the \(\omega\)-language expressive power of extended Petri nets
• More on the Size of Higman-Haines Sets: Effective Constructions
• The Complexity of Downward Closure Comparisons
• A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness
• On the Context-Freeness Problem for Vector Addition Systems
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Existential Definability over the Subword Ordering

   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 👍 👎

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)