scientific article; zbMATH DE number 3958712
From MaRDI portal
Publication:3727367
zbMATH Open0595.68024MaRDI QIDQ3727367FDOQ3727367
Authors: J. A. Bergstra, Jan Willem Klop 
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
- Process algebra with language matching
- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
- An algorithmic technique for protocol verification
- scientific article; zbMATH DE number 1555176
- Focus points and convergent process operators: A proof strategy for protocol verification
Cited In (33)
- A theory of stochastic systems. II: Process algebra
- Title not available (Why is that?)
- Full abstraction and recursion
- On the consistency of Koomen's fair abstraction rule
- The Austin Protocol Compiler.
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
- An axiomatic semantics for Esterel
- SOS formats and meta-theory: 20 years after
- An algebraic verification of a mobile network
- Focus points and convergent process operators
- Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
- A Generic Process Algebra
- An algorithmic technique for protocol verification
- Focus points and convergent process operators: A proof strategy for protocol verification
- Process algebra for hybrid systems
- Using probabilistic Kleene algebra pKA for protocol verification
- On sequential composition, action prefixes and process prefix
- Algebraic process verification.
- A compositional protocol verification using relativized bisimulation
- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
- Formal modeling of evolving self-adaptive systems
- Process algebra with guards: Combining hoare logic with process algebra
- Linearization of hybrid processes
- Fair testing
- Formalizing process algebraic verifications in the calculus of constructions
- Discrete time process algebra with abstraction
- A functional programming approach to the specification and verification of concurrent systems
- Fixed points in free process algebras. I
- Title not available (Why is that?)
- Ensuring liveness properties of distributed systems: open problems
- Axiomatizations for the perpetual loop in process algebra
- Title not available (Why is that?)
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 Q3727367)
