Translating FSP into LOTOS and networks of automata
From MaRDI portal
Publication:613134
DOI10.1007/s00165-009-0133-8zbMath1214.68220OpenAlexW2011368057MaRDI QIDQ613134
Rémi Hérilier, Gwen Salaün, Frédéric Lang, J. Magee, Jeff Kramer
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
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)
Related Items (2)
CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes ⋮ Compositional verification of asynchronous concurrent systems using CADP
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- State space reduction for process algebra specifications
- CCS expressions, finite state processes, and three problems of equivalence
- Efficient on-the-fly model-checking for regular alternation-free \(\mu\)-calculus
- Formalising a value-passing calculus in H0L
- Translating FSP into LOTOS and Networks of Automata
- A Theory of Communicating Sequential Processes
- Three Partition Refinement Algorithms
- Translating Hardware Process Algebras into Standard Process Algebras: Illustration with CHP and LOTOS
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- csp2B: A practical approach to combining CSP and B
This page was built for publication: Translating FSP into LOTOS and networks of automata