Translating FSP into LOTOS and networks of automata
From MaRDI portal
Publication:613134
DOI10.1007/s00165-009-0133-8zbMath1214.68220MaRDI QIDQ613134
Jeff Kramer, Frédéric Lang, Gwen Salaün, J. Magee, Rémi Hérilier
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
verification; process algebra; automated translation; communicating automata; FSP; LOTOS; parallel composition
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
