Well-structured languages

DOI10.1007/S00236-007-0050-3MaRDI QIDQ2641880zbMATH OpenOpenAlexFDO

Authors G. Geeraerts, Jean-François Raskin, Laurent Van Begin

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

formal languagesPetri 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)

Recommendations

• The structure of programming languages
• Many aspects of formal languages
• Languages and P0L schemes
• The language of structures
• Formal languages defined by the underlying structure of their words
• scientific article; zbMATH DE number 3872706
• scientific article; zbMATH DE number 3438410
• scientific article; zbMATH DE number 709368
• Syntactic structures of regular languages
• Formal languages and compilation

Cites work

• scientific article; zbMATH DE number 1670768 (Why is no real title available?)
• scientific article; zbMATH DE number 3902039 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 3509706 (Why is no real title available?)
• scientific article; zbMATH DE number 2080048 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 1392309 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• On the \(\omega\)-language expressive power of extended Petri nets
• Petri nets with non-blocking arcs are difficult to analyze
• Reasoning about systems with many processes
• Well-structured transition systems everywhere!

Cited in

(14)

• 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
• On the Efficient Computation of the Minimal Coverability Set for Petri Nets
• A Biologically Inspired Model with Fusion and Clonation of Membranes
• General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
• Applications and Theory of Petri Nets 2005
• Forward analysis and model checking for trace bounded WSTS
• Forward analysis and model checking for trace bounded WSTS
• Regular separability of well-structured transition systems
• On Boolean closed full trios and rational Kripke frames
• General decidability results for asynchronous shared-memory programs: higher-order and beyond
• Unboundedness problems for languages of vector addition systems
• Comparing the Expressive Power of Well-Structured Transition Systems
• Coverability, termination, and finiteness in recursive Petri nets

This page was built for publication: Well-structured languages

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