scientific article; zbMATH DE number 3808928
From MaRDI portal
Publication:3657409
zbMATH Open0512.68012MaRDI QIDQ3657409FDOQ3657409
Authors: Gordon D. Plotkin 
Publication date: 1983
Title of this publication is not available (Why is that?)
programming languagesspecificationlabelled transition systemscommunicating sequential processesnesting of parallel commandsstructural induction on abstract syntax
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Cited In (59)
- A context dependent equivalence between processes
- Four domains for concurrency
- Logical foundations for programming semantics
- Open maps, behavioural equivalences, and congruences
- Process algebra with language matching
- Read-write causality
- Two normal form theorems for CSP programs
- Towards a foundation for semantics in complete metric spaces
- A denotational theory of synchronous reactive systems
- Operational semantics of a kernel of the language ELECTRE
- A process algebraic view of input/output automata
- Concurrency and atomicity
- Notions of computation and monads
- Contractions in comparing concurrency semantics
- The origins of structural operational semantics
- Transition system specifications with negative premises
- Process calculus based upon evaluation to committed form
- Structured operational semantics and bisimulation as a congruence
- A \(\pi\)-calculus with explicit substitutions
- Computational adequacy for recursive types in models of intuitionistic set theory
- GSOS and finite labelled transition systems
- A non-SOS operational semantics for a process algebra
- A denotational semantics for shared-memory parallelism and nondeterminism
- Sequential and concurrent behaviour in Petri net theory
- Step failures semantics and a complete proof system
- Terminal metric spaces of finitely branching and image finite linear processes
- Appraising fairness in languages for distributed programming
- Revisiting sequential composition in process calculi
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Revisiting Semantics of Interactions for Trace Validity Analysis
- Full abstraction for the second order subset of an Algol-like language
- Recursive process definitions with the state operator
- A general conservative extension theorem in process algebras with inequalities
- Swinging types=functions+relations+transition systems
- A semantic characterization for faults in replicated systems
- Communicating processes with value-passing and assignments
- Congruent weak bisimulation with dense real-time
- Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule
- Corrigenda:Cooperating proofs for distributed programs with multiparty interactions
- Proof theory for exception handling in a tasking environment
- A weakest precondition semantics for communicating processes
- Fairness and hyperfairness in multi-party interactions
- On the suitability of trace semantics for modular proofs of communicating processes
- Issues in the design of a parallel object-oriented language
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
- Comparative semantics for flow of control in logic programming without logic
- Constraint satisfaction using constraint logic programming
- A structural operational semantics for an Edison-like language
- Comparative metric semantics for concurrent PROLOG
- From algebra to operational semantics
- Designing equivalent semantic models for process creation
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- Compilation of the ELECTRE reactive language into finite transition systems
- Strong fairness and full abstraction for communicating processes
- Embedding untimed into timed process algebra; the case for explicit termination
- Bounded stacks, bags and queues
- A logical and graphical framework for reaction systems
- Exploiting Modularity of SOS Semantics to Define Quantitative Extensions of Reaction Systems
- A unified rule format for bounded nondeterminism in SOS with terms as labels
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3657409)
