Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)

DOI10.1016/0304-3975(85)90028-3zbMath0571.68018OpenAlexW2121063006MaRDI QIDQ1061481

Joost Engelfriet

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90028-3

zbMATH Keywords

determinacyobservation equivalenceparallel processtrace equivalence

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (16)

Modelling and analysing neural networks using a hybrid process algebra ⋮ When is partial trace equivalence adequate? ⋮ Trace-Relating Compiler Correctness and Secure Compilation ⋮ On the expressive power of behavioral profiles ⋮ Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence) ⋮ Global renaming operators in concrete process algebra ⋮ Stable families of behavioural equivalences ⋮ Deciding equivalence-based properties using constraint solving ⋮ Rule formats for determinism and idempotence ⋮ On deciding some equivalences for concurrent processes ⋮ Characteristic Formulae for Timed Automata ⋮ Conditions of contracts for separating responsibilities in heterogeneous systems ⋮ Multiple Viewpoint Contract-Based Specification and Design ⋮ Asynchronous communication of Petri Nets and the refinement of transitions ⋮ A complete equational axiomatization for MPA with string iteration ⋮ Impossible futures and determinism

Cites Work

• Calculi for synchrony and asynchrony
• A calculus of communicating systems
• A lattice-theoretical fixpoint theorem and its applications
• A Theory of Communicating Sequential Processes
• Unnamed Item
• Unnamed Item

This page was built for publication: Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)