Automata, Languages and Programming

DOI10.1007/11523468zbMath1085.68593OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716866

No author found.

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

zbMATH Keywords

OrthogonalityConservative ExtensionFormal SemanticsEquational ConservativityOperational ConservativityStructural Operational Semantics (SOS)

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) 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 (4)

Duplication of constants in process algebra ⋮ SOS formats and meta-theory: 20 years after ⋮ Rule formats for determinism and idempotence ⋮ Lifting non-finite axiomatizability results to extensions of process algebras

This page was built for publication: Automata, Languages and Programming