Ordinal theory for expressiveness of well-structured transition systems

DOI10.1016/j.ic.2012.11.003zbMath1286.68343OpenAlexW2074302342WikidataQ57831201 ScholiaQ57831201MaRDI QIDQ1951597

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

Publication date: 6 June 2013

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2012.11.003

zbMATH Keywords

expressivenessordinalswell-structured transition systemswell-partial orderscoverability languages

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Ordinal and cardinal numbers (03E10)

Related Items (1)

Coverability, Termination, and Finiteness in Recursive Petri Nets

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