scientific article; zbMATH DE number 4016181
From MaRDI portal
Recommendations
Cited in
(53)- A Non-interleaving Denotational Semantics of Value Passing CCS with Action Refinement
- Reactive Turing machines
- Linear time and branching time semantics for recursion with merge
- CSP for parallelising Brzozowski's DFA construction algorithm
- Metric semantics for concurrency
- Process algebra and model checking
- Process algebras for network communication
- CSP-CASL -- a new integration of process algebra and algebraic specification
- Handbook of truly concurrent process algebra
- scientific article; zbMATH DE number 3990852 (Why is no real title available?)
- scientific article; zbMATH DE number 4011914 (Why is no real title available?)
- The composability problem of the semantics of XYZ/BE-communicating processes
- A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
- 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
- Two finite specifications of a queue
- scientific article; zbMATH DE number 3963182 (Why is no real title available?)
- 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
- Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
- Using Hoare logic in a process algebra setting
- Fixed point equations with parameters in the projective model
- Computing with actions and communications
- Fairness and regularity for SCCS processes
- Parallel processes with implicit computational capital
- A refinement calculus for specifications in Hennessy-Milner logic with recursion
- Strong bisimilarity of simple process algebras: Complexity lower bounds
- Translating Hardware Process Algebras into Standard Process Algebras: Illustration with CHP and LOTOS
- scientific article; zbMATH DE number 937812 (Why is no real title available?)
- A brief history of process algebra
- scientific article; zbMATH DE number 4119652 (Why is no real title available?)
- From ATP to timed graphs and hybrid systems
- Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule
- scientific article; zbMATH DE number 5181778 (Why is no real title available?)
- Process Bisimulation Via a Graphical Encoding
- Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement
- Reactive bisimulation semantics for a process algebra with timeouts
- Real time process algebra
- Formalizing process algebraic verifications in the calculus of constructions
- Interpreted Systems Semantics for Process Algebra with Identity Annotations
- An algebra for process creation
- Fixed points in free process algebras. I
- scientific article; zbMATH DE number 139606 (Why is no real title available?)
- Modeling and analysis of communicating systems
- scientific article; zbMATH DE number 4157900 (Why is no real title available?)
- scientific article; zbMATH DE number 683363 (Why is no real title available?)
- scientific article; zbMATH DE number 1555176 (Why is no real title available?)
- Process algebras as specification language (work in progress)
- Contradiction-Tolerant Process Algebra with Propositional Signals
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)
