Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Infinite trace equivalence

From MaRDI portal
Publication:2852364
Jump to:navigation, search

zbMATH Open1273.68209MaRDI QIDQ2852364FDOQ2852364


Authors: Paul Blain Levy Edit this on Wikidata


Publication date: 8 October 2013


Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066106002064




Recommendations

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


Mathematics Subject Classification ID

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



Cited In (3)

  • Amb Breaks Well-Pointedness, Ground Amb Doesn't
  • Infinite trace equivalence
  • 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 Q2852364)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2852364&oldid=15784955"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 19:22. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki