The Synthesis Problem of Netcharts

DOI10.1007/11767589_6MaRDI QIDQ3618700zbMATH OpenOpenAlexFDO

Authors Nicolas Baudru, Rémi Morin

Publication date 2 April 2009

Published in Petri Nets and Other Models of Concurrency - ICATPN 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11767589_6

Mathematics Subject Classification ID

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

Recommendations

• CONCUR 2004 - Concurrency Theory
• Netcharts: bridging the gap between HMSCs and executable specifications.
• scientific article; zbMATH DE number 512821
• scientific article; zbMATH DE number 1759633
• Infinite-state high-level MSCs: model-checking and realizability

Cited in

(3)

• CONCUR 2004 - Concurrency Theory
• Compositional synthesis of asynchronous automata
• Netcharts: bridging the gap between HMSCs and executable specifications.

This page was built for publication: The Synthesis Problem of Netcharts

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