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