Well-structured languages
From MaRDI portal
Publication:2641880
DOI10.1007/s00236-007-0050-3zbMath1119.68105MaRDI 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
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, Coverability, Termination, and Finiteness in Recursive Petri Nets, General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond, 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, General decidability results for asynchronous shared-memory programs: higher-order and beyond, On Boolean closed full trios and rational Kripke frames, Forward Analysis and Model Checking for Trace Bounded WSTS, On the Efficient Computation of the Minimal Coverability Set for Petri Nets, A Biologically Inspired Model with Fusion and Clonation of Membranes, A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
Cites Work
