scientific article; zbMATH DE number 4016181
From MaRDI portal
zbMATH Open0625.68023MaRDI QIDQ3028334FDOQ3028334
Authors: J. A. Bergstra, Jan Willem Klop 
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
Cited In (53)
- Reactive Turing machines
- Linear time and branching time semantics for recursion with merge
- Metric semantics for concurrency
- Process algebra and model checking
- Process algebras for network communication
- Handbook of truly concurrent process algebra
- CSP-CASL -- a new integration of process algebra and algebraic specification
- Title not available (Why is that?)
- Title not available (Why is that?)
- A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
- The composability problem of the semantics of XYZ/BE-communicating processes
- Modular specification of process algebras
- Bisimulation for higher-order process calculi
- Structural operational semantics for weak bisimulations
- SOS rule formats for zero and unit elements
- Unguardedness mostly means many solutions
- Title not available (Why is that?)
- Two finite specifications of a queue
- A process algebra for interworkings.
- A complete equational axiomatization for MPA with string iteration
- On functions preserving levels of approximation: A refined model construction for various lambda calculi
- Using Hoare logic in a process algebra setting
- Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
- Computing with actions and communications
- Fixed point equations with parameters in the projective model
- Fairness and regularity for SCCS processes
- Parallel processes with implicit computational capital
- Strong bisimilarity of simple process algebras: Complexity lower bounds
- A refinement calculus for specifications in Hennessy-Milner logic with recursion
- Translating Hardware Process Algebras into Standard Process Algebras: Illustration with CHP and LOTOS
- Title not available (Why is that?)
- Title not available (Why is that?)
- A brief history of process algebra
- From ATP to timed graphs and hybrid systems
- Title not available (Why is that?)
- Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule
- Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement
- Process Bisimulation Via a Graphical Encoding
- Reactive bisimulation semantics for a process algebra with timeouts
- Real time process algebra
- Interpreted Systems Semantics for Process Algebra with Identity Annotations
- Formalizing process algebraic verifications in the calculus of constructions
- An algebra for process creation
- Title not available (Why is that?)
- Fixed points in free process algebras. I
- Modeling and analysis of communicating systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Process algebras as specification language (work in progress)
- Contradiction-Tolerant Process Algebra with Propositional Signals
- A Non-interleaving Denotational Semantics of Value Passing CCS with Action Refinement
- CSP for parallelising Brzozowski's DFA construction algorithm
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 Q3028334)
