scientific article

Publication date: 1983

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

programming languages specification labelled transition systems communicating sequential processes nesting of parallel commands structural induction on abstract syntax

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items (58)

A semantic characterization for faults in replicated systems ⋮ GSOS and finite labelled transition systems ⋮ The origins of structural operational semantics ⋮ Revisiting Semantics of Interactions for Trace Validity Analysis ⋮ A context dependent equivalence between processes ⋮ A non-SOS operational semantics for a process algebra ⋮ Computational adequacy for recursive types in models of intuitionistic set theory ⋮ Two normal form theorems for CSP programs ⋮ A \(\pi\)-calculus with explicit substitutions ⋮ Transition systems, metric spaces and ready sets in the semantics of uniform concurrency ⋮ Designing equivalent semantic models for process creation ⋮ Appraising fairness in languages for distributed programming ⋮ Full abstraction for the second order subset of an Algol-like language ⋮ Sequential and concurrent behaviour in Petri net theory ⋮ A unified rule format for bounded nondeterminism in SOS with terms as labels ⋮ Concurrency and atomicity ⋮ Terminal metric spaces of finitely branching and image finite linear processes ⋮ Open maps, behavioural equivalences, and congruences ⋮ Read-write causality ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ Process algebra with language matching ⋮ Revisiting sequential composition in process calculi ⋮ Bounded stacks, bags and queues ⋮ Issues in the design of a parallel object-oriented language ⋮ Comparative metric semantics for concurrent PROLOG ⋮ Proof theory for exception handling in a tasking environment ⋮ Contractions in comparing concurrency semantics ⋮ Bisimulation for probabilistic transition systems: A coalgebraic approach ⋮ Towards a foundation for semantics in complete metric spaces ⋮ Four domains for concurrency ⋮ Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule ⋮ Compilation of the ELECTRE reactive language into finite transition systems ⋮ A process algebraic view of input/output automata ⋮ A denotational theory of synchronous reactive systems ⋮ Operational semantics of a kernel of the language ELECTRE ⋮ Transition system specifications with negative premises ⋮ Logical foundations for programming semantics ⋮ Structured operational semantics and bisimulation as a congruence ⋮ Communicating processes with value-passing and assignments ⋮ Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination ⋮ Constraint satisfaction using constraint logic programming ⋮ From algebra to operational semantics ⋮ Step failures semantics and a complete proof system ⋮ A logical and graphical framework for reaction systems ⋮ Congruent weak bisimulation with dense real-time ⋮ Fairness and hyperfairness in multi-party interactions ⋮ Corrigenda:Cooperating proofs for distributed programs with multiparty interactions ⋮ Notions of computation and monads ⋮ Recursive process definitions with the state operator ⋮ Process calculus based upon evaluation to committed form ⋮ Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP ⋮ Swinging types=functions+relations+transition systems ⋮ A weakest precondition semantics for communicating processes ⋮ A denotational semantics for shared-memory parallelism and nondeterminism ⋮ Strong fairness and full abstraction for communicating processes ⋮ On the suitability of trace semantics for modular proofs of communicating processes ⋮ Comparative semantics for flow of control in logic programming without logic ⋮ A structural operational semantics for an Edison-like language

This page was built for publication: