scientific article
From MaRDI portal
zbMATH Open0612.68025MaRDI QIDQ3753475FDOQ3753475
Publication date: 1987
Title of this publication is not available (Why is that?)
consistencybisimulationlivenessbounded 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)
Cited In (27)
- A structural induction theorem for processes
- Modular specification of process algebras
- On the consistency of Koomen's fair abstraction rule
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
- An axiomatic semantics for Esterel
- (Bi)simulations up-to characterise process semantics
- SOS formats and meta-theory: 20 years after
- Transition system specifications with negative premises
- Structured operational semantics and bisimulation as a congruence
- Fixed point equations with parameters in the projective model
- Semantics and expressiveness of ordered SOS
- Boundedness analysis of finitely recursive processes. I. Concurrent processes
- Axiomatizing GSOS with termination
- Thread algebra for strategic interleaving
- Rooted branching bisimulation as a congruence
- Recursive process definitions with the state operator
- A general conservative extension theorem in process algebras with inequalities
- Title not available (Why is that?)
- Simulations up-to and canonical preorders (extended abstract)
- Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule
- Weak Bisimulation as a Congruence in MSOS
- A syntactical approach to weak (bi-)simulation for coalgebras
- A unified rule format for bounded nondeterminism in SOS with terms as labels
- A nondeterministic extension over finitely recursive process model
- An algebra for process creation
- Language preorder as a precongruence
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753475)
