An algebra of behavioural types

DOI10.1016/J.IC.2011.12.005zbMATH Open1260.68277OpenAlexW1990799174MaRDI QIDQ418153FDOQ418153

António Ravara, Vasco T. Vasconcelos, Pedro Resende

Publication date: 24 May 2012

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2011.12.005

Recommendations

• scientific article; zbMATH DE number 1760051
• Behavioural typing for objects and process calculi
• Towards an algebraic theory of typed mobile processes
• scientific article; zbMATH DE number 1304364
• An Algebraic Framework for Defining Behaviours of Concurrent Systems. Part 1: The Constructive Presentation

zbMATH Keywords

completenessprocess algebratype systemsoundnessbehavioural equivalenceaxiomatisationconcurrent object

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• A calculus of mobile processes. II
• Title not available (Why is that?)
• Algebra of communicating processes with abstraction
• Results on the propositional \(\mu\)-calculus
• The lambda calculus, its syntax and semantics
• Types and programing languages
• Title not available (Why is that?)
• Conversation types
• Title not available (Why is that?)
• A complete axiomatisation for observational congruence of finite-state behaviours
• Title not available (Why is that?)
• On the consistency of Koomen's fair abstraction rule
• An interpretation of typed objects into typed \(\pi\)-calculus
• A shorter proof to uniqueness of solutions of equations
• Formal methods for open object-based distributed systems. FMOODS, IFIP TC6/ WG6. 1 3rd international conference, Florence, Italy, February 15--18, 1999
• The \(\pi\)-calculus in direct style
• CONCUR '93. 4th international conference on concurrency theory, Hildesheim, Germany, August 23--26, 1993. Proceedings
• The type and effect discipline
• Process rewrite systems.
• Bisimilarity of open terms.
• A generic type system for the pi-calculus
• Bisimulation equivalence is decidable for all context-free processes
• Spatial and behavioral types in the pi-calculus
• Refining the undecidability border of weak bisimilarity
• Title not available (Why is that?)
• Logical Semantics of Types for Concurrency
• An algebra of behavioural types
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• State inference for dynamically changing interfaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Strong types for coordinating active objects
• Title not available (Why is that?)
• Title not available (Why is that?)
• Types as models
• Title not available (Why is that?)
• Infinite results

Cited In (5)

• Formal Methods for Components and Objects
• An algebra of behavioural types
• Title not available (Why is that?)
• Sub-behaviour relations for session-based client/server systems
• Towards an algebraic theory of typed mobile processes

Uses Software

• PIPER

This page was built for publication: An algebra of behavioural types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418153)