Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
From MaRDI portal
Publication:3763573
DOI10.1093/comjnl/30.6.498zbMath0627.68016OpenAlexW2163123880MaRDI QIDQ3763573
Jan 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
readiness semanticsprocess semanticsfailure semanticsatomic actions with prioritybi-simulation semanticsfinite processes without silent movesprocess graph transformations
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Related Items
Automatizing parametric reasoning on distributed concurrent systems, A complete axiomatization of finite-state ACSR processes, Conjunction on processes: Full abstraction via ready-tree semantics, A process algebra of communicating shared resources with dense time and priorities, Unnamed Item, Notes on the methodology of CCS and CSP, Probabilistic may/must testing: retaining probabilities by restricted schedulers, Unnamed Item, Algebraic and fixed point equations over inverse limits of algebras, On deciding some equivalences for concurrent processes, Petri net semantics of priority systems, Algebraic characterizations of trace and decorated trace equivalences over tree-like structures, Branching bisimulation for probabilistic systems: characteristics and decidability, Refusal testing, Modular specification of process algebras, Equations, Contractions, and Unique Solutions, An expressiveness study of priority in process calculi, CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
