Well-structured languages

DOI10.1007/s00236-007-0050-3zbMath1119.68105OpenAlexW1991275081MaRDI QIDQ2641880

Gilles Geeraerts, Laurent Van Begin, Jean-François Raskin

Publication date: 17 August 2007

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-007-0050-3

zbMATH Keywords

Petri netsformal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (12)

On Boolean closed full trios and rational Kripke frames ⋮ Forward analysis and model checking for trace bounded WSTS ⋮ General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond ⋮ On the Efficient Computation of the Minimal Coverability Set for Petri Nets ⋮ Unnamed Item ⋮ A Biologically Inspired Model with Fusion and Clonation of Membranes ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Forward Analysis and Model Checking for Trace Bounded WSTS ⋮ A classification of the expressive power of well-structured transition systems ⋮ A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations ⋮ General decidability results for asynchronous shared-memory programs: higher-order and beyond ⋮ Coverability, Termination, and Finiteness in Recursive Petri Nets

Cites Work

• Reasoning about systems with many processes
• Well-structured transition systems everywhere!
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Well-structured languages