scientific article; zbMATH DE number 7204383

DOI10.4230/LIPIcs.MFCS.2017.49zbMath1441.68142arXiv1701.02927MaRDI QIDQ5111264

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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Petri netsdownward closureupward closureBPP nets

Mathematics Subject Classification ID

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

Related Items (2)

Existential Definability over the Subword Ordering ⋮ Unnamed Item

Cites Work

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

This page was built for publication: