Two case studies of semantics execution in Maude: CCS and LOTOS
type: Item
instance of: scholarly article
title: Two case studies of semantics execution in Maude: CCS and LOTOS
zbMATH Open document ID: 1086.68552
author: Alberto Verdejo
author: Narciso Martí-Oliet
published in: Formal Methods in System Design
publication date: 2006-02-20T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 03B70
zbMATH DE Number: 5007761
zbMATH Keywords: rewriting logic
zbMATH Keywords: Maude
zbMATH Keywords: executable semantic framework
zbMATH Keywords: internal strategies
zbMATH Keywords: CCS
zbMATH Keywords: Hennessy-Milner modal logic
zbMATH Keywords: symbolic semantics for LOTOS
zbMATH Keywords: ACT ONE
Wikidata QID: Q123905900
describes a project that uses: Isabelle/HOL
describes a project that uses: Maude
describes a project that uses: LEGO
describes a project that uses: XSB
describes a project that uses: Coq
describes a project that uses: ML
describes a project that uses: ELAN
describes a project that uses: CADP
describes a project that uses: HOL
describes a project that uses: Oz
describes a project that uses: LOTOSphere
MaRDI profile type: Publication
full work available at URL: s10703-005-2254-x
OpenAlex ID: W2053342841
cites work: Q4435458
cites work: Q4736387
cites work: Q4223001
cites work: Q4222985
cites work: Tabled evaluation with delaying for general logic programs
cites work: Reflection in rewriting logic. Metalogical foundations and metaprogramming applications
cites work: Q4222994
cites work: Maude: specification and programming in rewriting logic
cites work: Q4222979
cites work: Reflection in conditional rewriting logic
cites work: Generic tools for verifying concurrent systems
cites work: Q3327701
cites work: Q3221381
cites work: Q5287513
cites work: Symbolic bisimulations
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Q4365103
cites work: Q3777424
cites work: \(\pi\)-calculus in (Co)inductive-type theory
cites work: Rewriting logic: Roadmap and bibliography
cites work: Conditional rewriting logic as a unified model of concurrency
cites work: Q4263840
cites work: Q4222877
cites work: Formalising a value-passing calculus in H0L
cites work: Isabelle/HOL. A proof assistant for higher-order logic
cites work: A first-order syntax for the \(\pi\)-calculus in Isabelle/HOL using permutations
cites work: Q2769442
DOI: 10.1007/S10703-005-2254-X
description: scientific article; zbMATH DE number 5007761