Some Remarks on Definability of Process Graphs

DOI10.1007/11817949_2MaRDI QIDQ5756607zbMATH OpenOpenAlexFDO

Authors Clemens Grabmayer, Jan Willem Klop, Bas Luttik

Publication date 4 September 2007

Published in CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11817949_2

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5180
• On process languages in finite graphs
• scientific article; zbMATH DE number 2081021
• scientific article; zbMATH DE number 3909750
• scientific article; zbMATH DE number 1696537
• On the definability of properties of finite graphs
• A structural induction theorem for processes
• scientific article; zbMATH DE number 1337886
• Remarks on the Reachability Graphs of Petri Nets
• Definability and Complexity of Graph Parameters (Invited Talk).

This page was built for publication: Some Remarks on Definability of Process Graphs

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