scientific article; zbMATH DE number 794263

zbMath0839.68060MaRDI QIDQ4847024

Chris Verhoef

Publication date: 10 June 1996

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

zbMATH Keywords

structured operational semanticspanth format

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (35)

Pushdown Automata and Context-Free Grammars in Bisimulation Semantics ⋮ The meaning of negative premises in transition system specifications. II ⋮ Axiomatizing GSOS with termination ⋮ Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation ⋮ A format for semantic equivalence comparison ⋮ A syntactic commutativity format for SOS ⋮ Priority and abstraction in process algebra ⋮ Event algebra for transition systems composition application to timed automata ⋮ Duplication of constants in process algebra ⋮ A generalization of ACP using Belnap's logic ⋮ Bisimulation on speed: Worst-case efficiency ⋮ SOS formats and meta-theory: 20 years after ⋮ Congruence from the operator's point of view. Syntactic requirements on modal characterizations ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ Process algebra with propositional signals ⋮ An alternative formulation of operational conservativity with binding terms. ⋮ Rule formats for determinism and idempotence ⋮ A Rule Format for Associativity ⋮ Rooted branching bisimulation as a congruence ⋮ Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity ⋮ Variable binding operators in transition system specifications ⋮ Notions of bisimulation and congruence formats for SOS with data ⋮ Bochvar-McCarthy logic and process algebra ⋮ SOS rule formats for zero and unit elements ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Bisimulation on speed: a unified approach ⋮ A conservative look at operational semantics with variable binding ⋮ A process algebra with distributed priorities ⋮ Language preorder as a precongruence ⋮ A comparison of Statecharts step semantics ⋮ Ordered SOS process languages for branching and eager bisimulations ⋮ A Generalization of ACP Using Belnap's Logic ⋮ A Congruence Rule Format with Universal Quantification ⋮ Process algebra and conditional composition ⋮ Algebraic specification of agent computation

This page was built for publication: