Junior Automata - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2000

Junior Automata

(1, 2)
1
2

Abstract

One describes the way to produce finite states machines from programs written in Junior, a formalism for reactive programming in Java. The paper proposes the notion of a partial automaton for dealing with large size numbers of states.
Fichier principal
Vignette du fichier
RR-4031.pdf (272.81 Ko) Télécharger le fichier

Dates and versions

inria-00072607 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072607 , version 1

Cite

Frédéric Boussinot. Junior Automata. [Research Report] RR-4031, INRIA. 2000, pp.23. ⟨inria-00072607⟩
111 View
72 Download

Share

Gmail Facebook Twitter LinkedIn More