Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator

DOI10.1093/COMJNL/30.6.498MaRDI QIDQ3763573zbMATH OpenOpenAlexFDO

Authors J. A. Bergstra, J. W. Klops, Jos C. M. Baeten

Publication date 1987

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/13968

zbMATH Keywords

atomic actions with prioritybi-simulation semanticsfailure semanticsfinite processes without silent movesprocess graph transformationsprocess semanticsreadiness semantics

Mathematics Subject Classification ID

Theory of operating systems (68N25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Priority and abstraction in process algebra
• Priorities in process algebras
• Conjunction on processes: Full abstraction via ready-tree semantics
• scientific article; zbMATH DE number 937812
• scientific article; zbMATH DE number 139606
• Foundations of Software Science and Computation Structures
• A formal semantics for concurrent systems with a priority relation
• A truly concurrent semantics for a process algebra using resource pomsets
• Process algebra having inherent choice: revised semantics for concurrent systems
• Process Algebra: An Algebraic Theory of Concurrency

Cited in

(23)

• Global renaming operators in concrete process algebra
• Algebraic and fixed point equations over inverse limits of algebras
• Petri net semantics of priority systems
• Automatizing parametric reasoning on distributed concurrent systems
• A complete axiomatization of finite-state ACSR processes
• A process algebra of communicating shared resources with dense time and priorities
• Notes on the methodology of CCS and CSP
• Modular specification of process algebras
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Encoding safety in \(\mathrm{CLL}_R\)
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Branching bisimulation for probabilistic systems: characteristics and decidability
• An expressiveness study of priority in process calculi
• scientific article; zbMATH DE number 4055005 (Why is no real title available?)
• On deciding some equivalences for concurrent processes
• scientific article; zbMATH DE number 2038703 (Why is no real title available?)
• scientific article; zbMATH DE number 7319030 (Why is no real title available?)
• Failure trace semantics for a process algebra with time-outs
• Discovering ePassport vulnerabilities using bisimilarity
• Equations, contractions, and unique solutions
• Refusal testing
• Algebraic characterizations of trace and decorated trace equivalences over tree-like structures
• Conjunction on processes: Full abstraction via ready-tree semantics

This page was built for publication: Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator

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