scientific article; zbMATH DE number 7215292

zbMath1491.68117arXiv1710.07258MaRDI QIDQ5114831

Jean Goubault-Larrecq, Michael Blondin, Alain Finkel

Publication date: 26 June 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forward analysis and model checking for trace bounded WSTS
• Reverse mathematics and initial intervals
• Multiset rewriting for the verification of depth-bounded processes with name binding
• The residue of vector sets with applications to decidability problems in Petri nets
• Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets)
• Theory of relations. Transl. from the French by P. Clote
• Ordered sets with no infinite antichains
• Reduction and covering of infinite reachability trees
• A unified approach for deciding the existence of certain petri net paths
• Rélations non reconstructibles par leurs restrictions
• Handling infinitely branching well-structured transition systems
• A well-structured framework for analysing Petri net extensions
• Algorithmic analysis of programs with well quasi-ordered domains.
• Using forward reachability analysis for verification of lossy channel systems
• Computable fixpoints in well-structured symbolic model checking
• Recursive Petri nets
• On families of mutually exclusive sets
• ω-Petri Nets: Algorithms and Complexity
• A Constructive Proof of the Topological Kruskal Theorem
• Extending the Rackoff technique to Affine nets
• ON YEN'S PATH LOGIC FOR PETRI NETS
• Forward Analysis for WSTS, Part II: Complete WSTS
• Bounds on Mobility
• Lossy Counter Machines Decidability Cheat Sheet
• Forward Analysis for WSTS, Part II: Complete WSTS
• Une extension d'un théorème de P. Jullien sur les âges de mots
• Undecidable verification problems for programs with unreliable channels
• On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• On Context-Free Languages
• Well-structured transition systems everywhere!
• On the complexity of the linear-time μ-calculus for Petri Nets

This page was built for publication: