Process algebra with language matching

DOI10.1016/S0304-3975(97)88197-2zbMath0901.68092OpenAlexW2152164636MaRDI QIDQ1391794

Jos van Wamel

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)88197-2

zbMATH Keywords

concurrent alternating bit protocollanguage matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebra of communicating processes with abstraction
• Global renaming operators in concrete process algebra
• Modular specification of process algebras
• Discrete time process algebra
• Real time process algebra
• Process algebra for synchronous communication
• Process Algebra
• Applications of Process Algebra
• Algebraic Specification of Communication Protocols
• Branching time and abstraction in bisimulation semantics

This page was built for publication: Process algebra with language matching