scientific article; zbMATH DE number 4001464

Jan A. Bergstra, Jan Willem Klop, Jos C. M. Baeten

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

distributed system concurrency priorities interrupts algebra of communicating processes ACP

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)

Related Items

Real space process algebra, GSOS and finite labelled transition systems, Axiomatizing GSOS with termination, Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation, Branching time and orthogonal bisimulation equivalence, On the consistency of Koomen's fair abstraction rule, Processes with probabilities, priority and time, Priority and abstraction in process algebra, Bisimilarity is not finitely based over BPA with interrupt, Preferential choice and coordination conditions, An incompleteness result in process algebra, SOS formats and meta-theory: 20 years after, A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time, CPO models for a class of GSOS languages, A process algebra of communicating shared resources with dense time and priorities, QoS negotiation in service composition, The algebra of communicating processes with empty process, Notes on the methodology of CCS and CSP, A general conservative extension theorem in process algebras with inequalities, Termination modulo equations by abstract commutation with an application to iteration, Process algebra with language matching, Extended Markovian Process Algebra, On the axiomatisability of priority. III: Priority strikes again, Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity, Reactive bisimulation semantics for a process algebra with timeouts, SOS rule formats for idempotent terms and idempotent unary operators, Algebraic specification of concurrent systems, Replacement freeness: a criterion for separating process calculi, Unnamed Item, Rooted branching bisimulation as a congruence, A process algebra with distributed priorities, CCS with priority guards, Transition system specifications with negative premises, Structured operational semantics and bisimulation as a congruence, Algorithms for task allocation in ants. (A study of temporal polyethism: Theory), Rule formats for distributivity, On the axiomatizability of priority. II, A modular framework for verifying versatile distributed systems, On the expressibility of priority, Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence, Compositional priority specification in real-time distributed systems., Modular specification of process algebras, Semantics and expressiveness of ordered SOS, Generating priority rewrite systems for OSOS process languages, Priority as extremal probability, A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems, A process algebra with distributed priorities, Language preorder as a precongruence, Divide and congruence III: Stability & divergence, The compression structure of a process, On the computational power of BlenX, An algebraic framework for urgency, Ordered SOS process languages for branching and eager bisimulations, Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems, Priorities in process algebras