644 search results - page 7 / 129 » Precedence Automata and Languages |
HYBRID
1998
Springer
13 years 11 months ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
IPL
2008
13 years 7 months ago
2008
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
FUIN
2008
13 years 7 months ago
2008
The aim of this work is to describe the translation from Intermediate Language, one of the input formalisms of the model checking platform VerICS, to timed automata with discrete d...
CONCUR
1998
Springer
13 years 11 months ago
1998
Springer
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
Port automata are an operational model for component connectors in a coordination language such as Reo. They describe which sets of ports can synchronize in each state of the conn...