scientific article

Luca Aceto, Chris Verhoef, W. J. Fokkink

Publication date: 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

survey process algebra structural operational semantics denotational semantics congruence formats many-sorted higher-order extensions transition system specification

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) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)

Related Items (89)

Modelling and analysing neural networks using a hybrid process algebra ⋮ Rational operational models ⋮ Evolution of rule-based programs ⋮ Modular structural operational semantics ⋮ Adding recursive constructs to bialgebraic semantics ⋮ Axiomatizing GSOS with termination ⋮ Rule formats for compositional non-interference properties ⋮ Unnamed Item ⋮ Syntax and consistent equation semantics of hybrid Chi ⋮ A syntactic commutativity format for SOS ⋮ A compositional coalgebraic model of fusion calculus ⋮ A general SOS theory for the specification of probabilistic transition systems ⋮ Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ⋮ On Rule Formats for Zero and Unit Elements ⋮ Nominal SOS ⋮ A Pre-congruence Format for XY-simulation ⋮ Structural Operational Semantics for Weighted Transition Systems ⋮ Structural Operational Semantics and Modal Logic, Revisited ⋮ Structural congruence for bialgebraic semantics ⋮ Duplication of constants in process algebra ⋮ Unnamed Item ⋮ Bisimulation on speed: Worst-case efficiency ⋮ A unified rule format for bounded nondeterminism in SOS with terms as labels ⋮ SOS formats and meta-theory: 20 years after ⋮ Structural operational semantics for stochastic and weighted transition systems ⋮ SOS specifications for uniformly continuous operators ⋮ Weak Bisimulation as a Congruence in MSOS ⋮ Congruence from the operator's point of view. Syntactic requirements on modal characterizations ⋮ \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics ⋮ Depletable channels: dynamics, behaviour, and efficiency in network design ⋮ Theory of interaction ⋮ Logical characterisations, rule formats and compositionality for input-output conformance simulation ⋮ On the axiomatisability of priority. III: Priority strikes again ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Foundational aspects of multiscale modeling of biological systems with process algebras ⋮ Enhanced coalgebraic bisimulation ⋮ Rule formats for determinism and idempotence ⋮ Logical Characterisations and Compositionality of Input-Output Conformance Simulation ⋮ Structural operational semantics through context-dependent behaviour ⋮ SOS rule formats for idempotent terms and idempotent unary operators ⋮ Bialgebras for structural operational semantics: an introduction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Compositional bisimulation metric reasoning with Probabilistic Process Calculi ⋮ Compositional semantics and behavioral equivalences for P systems ⋮ A Context-Free Process as a Pushdown Automaton ⋮ A Rule Format for Associativity ⋮ A Notion of Glue Expressiveness for Component-Based Systems ⋮ Thread algebra for strategic interleaving ⋮ Towards general axiomatizations for bisimilarity and trace semantics ⋮ Denotational semantics for thread algebra ⋮ Some undecidable properties of SOS specifications ⋮ Logics of temporal-epistemic actions ⋮ A general account of coinduction up-to ⋮ An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems ⋮ Rule formats for distributivity ⋮ A Basic Parallel Process as a Parallel Pushdown Automaton ⋮ Variable binding operators in transition system specifications ⋮ CCS with Hennessy's merge has no finite-equational axiomatization ⋮ Lifting non-finite axiomatizability results to extensions of process algebras ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ Notions of bisimulation and congruence formats for SOS with data ⋮ SOS rule formats for zero and unit elements ⋮ Probabilistic anonymity via coalgebraic simulations ⋮ A precongruence format for should testing preorder ⋮ On the expressibility of priority ⋮ Splitting bisimulations and retrospective conditions ⋮ Compositional semantics of spiking neural P systems ⋮ A brief history of process algebra ⋮ Process algebra for hybrid systems ⋮ A thread calculus with molecular dynamics ⋮ Implicit Propagation in Structural Operational Semantics ⋮ Structural Operational Semantics with First-Order Logic ⋮ Semantics and expressiveness of ordered SOS ⋮ Generating priority rewrite systems for OSOS process languages ⋮ A congruence rule format for name-passing process calculi ⋮ Bialgebraic methods and modal logic in structural operational semantics ⋮ Encoding safety in \(\mathrm{CLL}_R\) ⋮ Well-behaved Translations between Structural Operational Semantics ⋮ Coverability Synthesis in Parametric Petri Nets ⋮ Distributive laws for monotone specifications ⋮ Dynamic structural operational semantics ⋮ On constructibility and unconstructibility of LTS operators from other LTS operators ⋮ A comparison of Statecharts step semantics ⋮ Bialgebraic Methods in Structural Operational Semantics ⋮ On Well-Foundedness and Expressiveness of Promoted Tyft ⋮ Towards SOS Meta-Theory for Language-Based Security ⋮ A Congruence Rule Format with Universal Quantification ⋮ Compositional verification of asynchronous concurrent systems using CADP

This page was built for publication: