Translating FSP into LOTOS and Networks of Automata

DOI10.1007/978-3-540-73210-5_29MaRDI QIDQ3608896zbMATH OpenOpenAlexFDO

Authors Gwen Salaün, Jeff Kramer, Frédéric Lang, Jeff Magee

Publication date 6 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73210-5_29

Mathematics Subject Classification ID

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

Recommendations

• Translating FSP into LOTOS and networks of automata
• scientific article; zbMATH DE number 140241
• Mapping Petri nets with inhibitor arcs onto basic LOTOS behavior expressions
• Translating Hardware Process Algebras into Standard Process Algebras: Illustration with CHP and LOTOS
• From LOTOS to LNT

Cited in

(3)

• Reflections on the future of concurrency theory in general and process calculi in particular
• scientific article; zbMATH DE number 140241 (Why is no real title available?)
• Translating FSP into LOTOS and networks of automata

Describes a project that uses

Uses Software

• M-TREE

This page was built for publication: Translating FSP into LOTOS and Networks of Automata

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