An algebra of behavioural types

DOI10.1016/j.ic.2011.12.005zbMath1260.68277OpenAlexW1990799174MaRDI QIDQ418153

António Ravara, Pedro Resende, Vasco Thudichum Vasconcelos

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

zbMATH Keywords

process algebracompletenessbehavioural equivalencetype systemsoundnessaxiomatisationconcurrent object

Mathematics Subject Classification ID

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

Related Items (2)

An algebra of behavioural types ⋮ Sub-behaviour relations for session-based client/server systems

Uses Software

• PIPER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algebra of behavioural types
• Conversation types
• Results on the propositional \(\mu\)-calculus
• Algebra of communicating processes with abstraction
• On the consistency of Koomen's fair abstraction rule
• The lambda calculus, its syntax and semantics
• A calculus of mobile processes. II
• A complete axiomatisation for observational congruence of finite-state behaviours
• 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
• Logical Semantics of Types for Concurrency
• Algebraic laws for nondeterminism and concurrency
• State inference for dynamically changing interfaces
• Strong types for coordinating active objects
• Types as models
• Infinite results

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