scientific article

zbMath0605.68013MaRDI QIDQ3742698

Jan A. Bergstra, Jan Willem Klop

Publication date: 1986

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

zbMATH Keywords

graph theoretic modelsregular processesequational specificationsdata flow networksrecursively defined processesmerging processes

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

When is partial trace equivalence adequate? ⋮ On the consistency of Koomen's fair abstraction rule ⋮ On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ Actors, actions, and initiative in normative system specification ⋮ Deadlock and fairness in morphisms of transition systems ⋮ Global renaming operators in concrete process algebra ⋮ Generated models and the ω-rule: The nondeterministic case ⋮ A process algebra of communicating shared resources with dense time and priorities ⋮ Notes on the methodology of CCS and CSP ⋮ Bounded stacks, bags and queues ⋮ Analysing AWN-Specifications Using mCRL2 (Extended Abstract) ⋮ Comparing the expressiveness of the \(\pi \)-calculus and CCS ⋮ Combining data type and recursive process specifications using projection algebras ⋮ CCS expressions, finite state processes, and three problems of equivalence ⋮ On cool congruence formats for weak bisimulations ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Fixed point equations with parameters in the projective model ⋮ Fixed points in free process algebras. I ⋮ Bisimulation of automata ⋮ Interactive verification of architectural design patterns in FACTum ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions ⋮ A complete modal proof system for HAL: the Herbrand agent language ⋮ Active Evaluation Contexts for Reaction Semantics ⋮ Algebra of communicating processes with abstraction