Infinite trace equivalence

DOI10.1016/J.APAL.2007.10.007zbMATH Open1133.68016OpenAlexW2601092150MaRDI QIDQ2474445FDOQ2474445

Authors: Paul Blain Levy 

Publication date: 6 March 2008

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2007.10.007

Recommendations

• Infinite trace equivalence
• Unbounded nondeterminism in CSP
• scientific article; zbMATH DE number 4113946
• scientific article
• About the undecidability of program equivalence in finitary languages with state

zbMATH Keywords

game semanticsnondeterminisminfinite tracesjump-with-argument

Mathematics Subject Classification ID

Applications of game theory (91A80) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Cites Work

• Infinite trees and completely iterative theories: A coalgebraic view
• Algebraic operations and generic effects
• On full abstraction for PCF: I, II and III
• Title not available (Why is that?)
• Notions of computation and monads
• A theory for nondeterminism, parallelism, communication, and concurrency
• Title not available (Why is that?)
• Relational properties of domains
• Parametric corecursion
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classical logic, continuation semantics and abstract machines
• Presheaf models for CCS-like languages
• Title not available (Why is that?)
• Dualising initial algebras
• Title not available (Why is that?)
• Infinite trace equivalence
• Title not available (Why is that?)
• Call-by-push-value: Decomposing call-by-value and call-by-name
• The essence of parallel Algol.
• A fully abstract trace model for dataflow and asynchronous networks
• Typed Normal Form Bisimulation
• A category-theoretic semantics for unbounded indeterminacy

Cited In (7)

• Automatic construction of systems of distributed components from nested Petri nets models
• Title not available (Why is that?)
• Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies
• Exploratory functions on nondeterministic strategies, up to lower bisimilarity
• Title not available (Why is that?)
• Global State Considered Helpful
• On the concatenation of infinite traces

This page was built for publication: Infinite trace equivalence

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