scientific article; zbMATH DE number 3808928
From MaRDI portal
Publication:3657409
Cited in
(59)- On the suitability of trace semantics for modular proofs of communicating processes
- A structural operational semantics for an Edison-like language
- A context dependent equivalence between processes
- Two normal form theorems for CSP programs
- 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
- Sequential and concurrent behaviour in Petri net theory
- Concurrency and atomicity
- Terminal metric spaces of finitely branching and image finite linear processes
- 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
- A denotational theory of synchronous reactive systems
- Operational semantics of a kernel of the language ELECTRE
- Structured operational semantics and bisimulation as a congruence
- Constraint satisfaction using constraint logic programming
- From algebra to operational semantics
- Fairness and hyperfairness in multi-party interactions
- Process calculus based upon evaluation to committed form
- A semantic characterization for faults in replicated systems
- GSOS and finite labelled transition systems
- A \(\pi\)-calculus with explicit substitutions
- Full abstraction for the second order subset of an Algol-like language
- Open maps, behavioural equivalences, and congruences
- A general conservative extension theorem in process algebras with inequalities
- Process algebra with language matching
- Swinging types=functions+relations+transition systems
- Congruent weak bisimulation with dense real-time
- Corrigenda:Cooperating proofs for distributed programs with multiparty interactions
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
- Strong fairness and full abstraction for communicating processes
- The origins of structural operational semantics
- Computational adequacy for recursive types in models of intuitionistic set theory
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- A logical and graphical framework for reaction systems
- A unified rule format for bounded nondeterminism in SOS with terms as labels
- A non-SOS operational semantics for a process algebra
- Embedding untimed into timed process algebra; the case for explicit termination
- Revisiting Semantics of Interactions for Trace Validity Analysis
- Read-write causality
- Step failures semantics and a complete proof system
- Bounded stacks, bags and queues
- Exploiting Modularity of SOS Semantics to Define Quantitative Extensions of Reaction Systems
- Compilation of the ELECTRE reactive language into finite transition systems
- A process algebraic view of input/output automata
- Transition system specifications with negative premises
- Logical foundations for programming semantics
- Communicating processes with value-passing and assignments
- Notions of computation and monads
- Recursive process definitions with the state operator
- A weakest precondition semantics for communicating processes
- A denotational semantics for shared-memory parallelism and nondeterminism
- Comparative semantics for flow of control in logic programming without logic
- Revisiting sequential composition in process calculi
- 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
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)
