From LOTOS to LNT

DOI10.1007/978-3-319-68270-9_1zbMath1498.68062OpenAlexW2757839910MaRDI QIDQ5047037

Wendelin Serwe, Hubert Garavel, Frédéric Lang

Publication date: 9 November 2022

Published in: ModelEd, TestEd, TrustEd (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-68270-9_1

zbMATH Keywords

process algebraformal specificationalgebraic specificationspecification languageprocess calculusformal methodconcurrency theoryabstract data typeLOTOSE-LOTOSformal description techniqueLNT

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Probabilistic model checking of BPMN processes at runtime ⋮ Coupled similarity: the first 32 years ⋮ Nested-unit Petri nets ⋮ Compositional Specification in Rewriting Logic ⋮ Equivalence checking 40 years after: a review of bisimulation tools

This page was built for publication: From LOTOS to LNT