Zetav is a tool for verification of systems specified in RT-Logic language.
Verif is a tool for verification and computation trace analysis of systems described using the Modechart formalism. It can also generate a set of restricted RT-Logic formulae from a Modechart specification which can be used in Zetav.
With default configuration file write the system specification (SP) to the sp-formulas.in file and the checked property (security assertion, SA) to the sa-formulas.in file. Launch zetav-verifier.exe to begin the verification.
With the default configuration example files and outputs are load/stored to archive root directory. But using file-browser you are free to select any needed location. To begin launch run.bat (windows) or run.sh (linux / unix). Select Modechart designer and create Modechart model or load it from file.
She tapped the screen, zooming into a paragraph where subjunctive moods braided with idiomatic gold. The exercises in the PDF were less practice and more ritual: gap-fill puzzles that demanded intuition, debate prompts that unlocked a rush of argument and rhetoric, and vocabulary clusters linked by imagery—la guagua, la persiana, el desván—each word a tiled step toward fluency. The footnotes nudged her into cultural alleyways: news snippets, song lines, hints of humor unique to the Iberian peninsula.
In that quiet after-study glow, she saved the annotated PDF with a new file name—AulaC1_mastered_v1—and closed her laptop. Outside, the neighborhood hummed in Spanish rhythms. Inside, the lessons lived on: not as static text, but as a textured, ongoing conversation between curiosity and language—one downloadable PDF at a time. aula internacional c1 pdf
Here’s a vivid, engaging short piece inspired by "Aula Internacional C1 PDF" — blending sensory detail, study-life texture, and the thrill of language mastery. She tapped the screen, zooming into a paragraph
The classroom smelled like coffee and paper; late-afternoon light slanted across a spread of marked-up PDFs, the familiar header—Aula Internacional C1—staring back like a map. Each page was a small expedition: dense reading passages that tasted of iron and rain, grammar capsules that felt like clever pocket tools, and listening transcripts that still echoed with voices from Barcelona cafés and university lecture halls. In that quiet after-study glow, she saved the
Group study transformed the solitary document into theater. One student assumed the role of a frustrated minister from a listening exercise, another improvised a radio interview based on the reading, while someone else annotated the PDF in a riot of color: green for collocations, red for traps, purple for idioms. Laughter punctured the seriousness—a mispronounced palabra becomes an inside joke, and the PDF, once austere, felt like a shared artifact of their apprenticeship.
When the audio links played, the flat, printed sentences came alive. A narrator’s cadence turned abstract grammar into breathing conversation. She repeated phrases aloud, feeling the consonants line up like synchronized swimmers in her mouth. Mistakes were welcome here; the PDF’s answer key became a mirror, reflecting progress in marginalia—little ticks, circled errors, and forceful exclamation points where a new expression finally clicked.
The Zetav verifier expects the input RRTL formulae to be in the following form:
<rrtlformula> : <formula> [ CONNECTIVE <formula> ] ... <formula> : <predicate> | NOT <formula> | <quantifiedvars> <formula> | ( <formula> ) <predicate> : <function> PRED_SYMB <function> <function> : <function> FUNC_SYMB <function> | @( ACTION_TYPE ACTION , term ) | CONSTANT <quantifiedvars> : QUANTIFIER VARIABLE [ QUANTIFIER VARIABLE ] ...Where predicate symbols (PRED_SYMB) could be inequality operators <, =<, =, >=, >, function symbols (FUNC_SYMB) could be basic + and - operators, action type (ACTION_TYPE) could be starting action (^), stop action ($), transition action (%) and external action (#). Quantifier symbols (QUANTIFIER) could be either an universal quantifier (forall, V) or an existential quantifier (exists, E). Connectives (CONNECTIVE) could be conjunction (and, &, /\), disjunction (or, |, \/), or implication (imply, ->). All variables (VARIABLE) must start with a lower case letter and all actions (ACTION) with an upper case letter. Constants (CONSTANT) could be positive or negative number. RRTL formulae in the input file must be separated using semicolon (;).
V t V u (
( @(% TrainApproach, t) + 45 =< @(% Crossing, u) /\
@(% Crossing, u) < @(% TrainApproach, t) + 60
)
->
( @($ Downgate, t) =< @(% Crossing, u) /\
@(% Crossing, u) =< @($ Downgate, t) + 45
)
)
Verif tool does not deal with direct input. Examples are load from files with extension MCH. Those files are in XML and describes model modes structure and transition between modes. There is no need to directly modify those files. But in some cases it is possible to make some small changes manualy or generate Modechart models in another tool.
If you have further questions, do not hesitate to contact authors ( Jan Fiedor and Marek Gach ).
This work is supported by the Czech Science Foundation (projects GD102/09/H042 and P103/10/0306), the Czech Ministry of Education (projects COST OC10009 and MSM 0021630528), the European Commission (project IC0901), and the Brno University of Technology (project FIT-S-10-1).