Relational concurrent refinement part III: traces, partial relations and automata

ISSN： 0934-5043

Source： Formal Aspects of Computing, Vol.26, Iss.2, 2014-03, pp. : 407-432

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

-transitions in Concurrent Timed Automata

By Lanotte R. Maggiolo-Schettini A. Tini S.

Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. : 1-7

Elsevier

Access to resources Recommend Favorite

Mining GPS Traces for Map Refinement

By Schroedl Stefan Wagstaff Kiri Rogers Seth Langley Pat Wilson Christopher

Data Mining and Knowledge Discovery, Vol. 9, Iss. 1, 2004-07 ,pp. : 59-87

Springer Publishing Company

Access to resources Recommend Favorite

CSP, partial automata, and coalgebras

By Wolter U.

Theoretical Computer Science, Vol. 280, Iss. 1, 2002-05 ,pp. : 3-34

Elsevier

Access to resources Recommend Favorite

Checking Finite Traces using Alternating Automata

By Finkbeiner B. Sipma H.

Electronic Notes in Theoretical Computer Science, Vol. 55, Iss. 2, 2004-01 ,pp. : 1-17

Elsevier

Access to resources Recommend Favorite

Power Simulation and its Relation to Traces and Failures Refinement

By Gardiner P.

Electronic Notes in Theoretical Computer Science, Vol. 32, Iss. 1, 2004-01 ,pp. : 1-23

Elsevier

Access to resources Recommend Favorite