scientific article
From MaRDI portal
Publication:3753475
zbMath0612.68025MaRDI QIDQ3753475
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
consistencylivenessbisimulationbounded nondeterminismAlgebra of Communicating ProcessesACPapproximation induction principlecommutativity of abstractionKoomen's fair abstraction ruleno special rootedness conditionrecursive definition principle
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Theory of operating systems (68N25)
Related Items (24)
Axiomatizing GSOS with termination ⋮ On the consistency of Koomen's fair abstraction rule ⋮ Transition systems, metric spaces and ready sets in the semantics of uniform concurrency ⋮ A unified rule format for bounded nondeterminism in SOS with terms as labels ⋮ SOS formats and meta-theory: 20 years after ⋮ Weak Bisimulation as a Congruence in MSOS ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity ⋮ Rooted branching bisimulation as a congruence ⋮ Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule ⋮ Thread algebra for strategic interleaving ⋮ Transition system specifications with negative premises ⋮ Structured operational semantics and bisimulation as a congruence ⋮ An algebra for process creation ⋮ Fixed point equations with parameters in the projective model ⋮ An axiomatic semantics for Esterel ⋮ Unnamed Item ⋮ Modular specification of process algebras ⋮ Semantics and expressiveness of ordered SOS ⋮ (Bi)simulations up-to characterise process semantics ⋮ Recursive process definitions with the state operator ⋮ Language preorder as a precongruence ⋮ A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras ⋮ Simulations Up-to and Canonical Preorders
This page was built for publication:
