Infinite trace equivalence

DOI10.1016/J.APAL.2007.10.007MaRDI QIDQ2474445zbMATH OpenOpenAlexFDO

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

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)

Recommendations

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

Cites work

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

Cited in

(8)

• Automatic construction of systems of distributed components from nested Petri nets models
• scientific article; zbMATH DE number 7471671 (Why is no real title available?)
• Global state considered helpful
• Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies
• Infinite trace equivalence
• Exploratory functions on nondeterministic strategies, up to lower bisimilarity
• scientific article; zbMATH DE number 7533349 (Why is no real title available?)
• 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)