Proving Invariants of I/O Automata with TAME

ISSN： 0928-8910

Source： Automated Software Engineering, Vol.9, Iss.3, 2002-08, pp. : 201-232

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

Abstract

Related content

Proving nonreachability by modulo-invariants

By Desel J. Neuendorf K.-P. Radola M.-D.

Theoretical Computer Science, Vol. 153, Iss. 1, 1996-01 ,pp. : 49-64

Elsevier

Access to resources Recommend Favorite

Composition and behaviors of probabilistic I/O automata

By Plotkin G.D. Wu S.-H. Smolka S.A. Stark E.W.

Theoretical Computer Science, Vol. 176, Iss. 1, 1997-04 ,pp. : 1-38

Elsevier

Access to resources Recommend Favorite

Jackson’s Pseudo Preemptive Schedule for the Pm/r_{i}, q_{i}/C_{max} scheduling problem

By Carlier J. Pinson E.

Annals of Operations Research, Vol. 83, Iss. 1, 1998-01 ,pp. : 41-58

Springer Publishing Company

Access to resources Recommend Favorite

Proving sequential function chart programs using timed automata

By L'Her D. Parc P.L. Marce L.

Theoretical Computer Science, Vol. 267, Iss. 1, 2001-09 ,pp. : 141-155

Elsevier

Access to resources Recommend Favorite

RE/F/r.ACE: a participatory media artwork

By Best-Dunkley Andy

Digital Creativity, Vol. 23, Iss. 2, 2012-06 ,pp. : 136-143

Routledge Ltd

Access to resources Recommend Favorite