Two finite specifications of a queue

DOI10.1016/S0304-3975(96)00257-5zbMath0911.68010MaRDI QIDQ1391797

Marc Bezem, Alban Ponse

Publication date: 23 July 1998

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

zbMATH Keywords

finite specifications of a queue in ACP

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Reactive Turing machines ⋮ Non-regular iterators in process algebra

Cites Work

• Algebra of communicating processes with abstraction
• Global renaming operators in concrete process algebra
• Formal verification of a leader election protocol in process algebra
• Computable processes and bisimulation equivalence
• Laws of programming
• Process Algebra
• Branching time and abstraction in bisimulation semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two finite specifications of a queue