Equivalence of Processes in Partially Commutative Object-Oriented Environments

DOI10.3233/FI-2010-372MaRDI QIDQ3084991zbMATH OpenFDO

Authors A. S. Shoukourian, Hayk Grigoryan

Publication date 28 March 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2010-372

zbMATH Keywords

environment modelequivalence of processesmodel equationmultitape multidimensional automatonobject-oriented environmentpartially commutativeprocessregular expression

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 2038694
• Equivalence of recursive specifications in process algebra
• scientific article; zbMATH DE number 4104372
• On the unification of process semantics: equational semantics
• Typed behavioural equivalences for processes in the presence of subtyping
• Typed behavioural equivalences for processes in the presence of subtyping
• Programming Languages and Systems
• scientific article; zbMATH DE number 4035117
• Congruence from the operator's point of view: compositionality requirements on process semantics

Cited in

(2)

• scientific article; zbMATH DE number 3903949 (Why is no real title available?)
• Programming Languages and Systems

This page was built for publication: Equivalence of Processes in Partially Commutative Object-Oriented Environments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3084991)