Translating FSP into LOTOS and networks of automata
DOI10.1007/S00165-009-0133-8zbMATH Open1214.68220OpenAlexW2011368057MaRDI QIDQ613134FDOQ613134
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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- csp2B: A practical approach to combining CSP and B
- State space reduction for process algebra specifications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Three Partition Refinement Algorithms
- CCS expressions, finite state processes, and three problems of equivalence
- A Theory of Communicating Sequential Processes
- Title not available (Why is that?)
- Efficient on-the-fly model-checking for regular alternation-free \(\mu\)-calculus
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formalising a value-passing calculus in H0L
- Towards a unifying CSP approach to hierarchical verification of asynchronous hardware
- Translating FSP into LOTOS and Networks of Automata
- Title not available (Why is that?)
- Translating Hardware Process Algebras into Standard Process Algebras: Illustration with CHP and LOTOS
Cited In (5)
Uses Software
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)
