Translating FSP into LOTOS and networks of automata

DOI10.1007/S00165-009-0133-8MaRDI QIDQ613134zbMATH OpenOpenAlexFDO

Authors Frédéric Lang, Gwen Salaün, Rémi Hérilier, Jeff Kramer, Jeff Magee

Publication date 17 December 2010

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00165-009-0133-8

zbMATH Keywords

verificationprocess algebraautomated translationcommunicating automataFSPLOTOSparallel composition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Translating FSP into LOTOS and Networks of Automata
• Translating Hardware Process Algebras into Standard Process Algebras: Illustration with CHP and LOTOS
• From LOTOS to LNT
• Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets
• scientific article; zbMATH DE number 140241

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 3793396 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 176726 (Why is no real title available?)
• scientific article; zbMATH DE number 177845 (Why is no real title available?)
• scientific article; zbMATH DE number 1283472 (Why is no real title available?)
• scientific article; zbMATH DE number 2087557 (Why is no real title available?)
• scientific article; zbMATH DE number 1905116 (Why is no real title available?)
• A Theory of Communicating Sequential Processes
• CCS expressions, finite state processes, and three problems of equivalence
• Efficient on-the-fly model-checking for regular alternation-free -calculus
• Formalising a value-passing calculus in H0L
• State space reduction for process algebra specifications
• Three Partition Refinement Algorithms
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Towards a unifying CSP approach to hierarchical verification of asynchronous hardware
• Translating FSP into LOTOS and Networks of Automata
• Translating Hardware Process Algebras into Standard Process Algebras: Illustration with CHP and LOTOS
• csp2B: A practical approach to combining CSP and B

Cited in

(5)

• Translating FSP into LOTOS and Networks of Automata
• scientific article; zbMATH DE number 1990799 (Why is no real title available?)
• scientific article; zbMATH DE number 140241 (Why is no real title available?)
• CADP 2010: a toolbox for the construction and analysis of distributed processes
• Compositional verification of asynchronous concurrent systems using CADP

Describes a project that uses

Uses Software

• CAESAR
• csp2B
• Exp.Open
• Fiacre
• CADP
• Yices
• IF-2.0
• M-TREE
• BISIMULATOR
• jETI

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 Q613134)