Ordinal theory for expressiveness of well structured transition systems

DOI10.1007/978-3-642-19805-2_11zbMATH Open1326.68198OpenAlexW1856811321WikidataQ57831216 ScholiaQ57831216MaRDI QIDQ3000606FDOQ3000606

Authors: Rémi Bonnet, Serge Haddad, Fernando Rosa-Velardo, Alain Finkel 

Publication date: 19 May 2011

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19805-2_11

Recommendations

• Ordinal theory for expressiveness of well-structured transition systems
• Well-structured transition systems everywhere!
• A classification of the expressive power of well-structured transition systems
• The power of well-structured systems
• scientific article; zbMATH DE number 6790161

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)

Cited In (6)

• A classification of the expressive power of well-structured transition systems
• A complete and consistent formal system for sortals
• Ordinal theory for expressiveness of well-structured transition systems
• On the Expressivity of Optimality Theory versus Ordered Rewrite Rules
• Comparing the Expressive Power of Well-Structured Transition Systems
• Title not available (Why is that?)

This page was built for publication: Ordinal theory for expressiveness of well structured transition systems

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