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

DOI10.1093/COMJNL/30.6.498zbMATH Open0627.68016OpenAlexW2163123880MaRDI QIDQ3763573FDOQ3763573

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

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

zbMATH Keywords

process semanticsreadiness semanticsfailure semanticsatomic actions with prioritybi-simulation semanticsfinite processes without silent movesprocess graph transformations

Mathematics Subject Classification ID

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

Cited In (23)

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

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)