is the probabilistic transition function.We use q→i⋅oq′ to denote δ(q,i)(q′,o)>0 and extend this notation to traces t in (I⋅O)∗ by q→ϵq and q→i⋅o⋅tq′ if ∃q″:q→i⋅oq″∧q″→tq′. As is common in automata learning and testing, we consider inp...
We define and investigate a complexity measure defined for extended finite automata over groups (EFA). Roughly, an EFA is a finite automaton augmented with a register storing an element of a group, initially the identity element. When a transition is performed, not only the state, but the ...
2.2 Extended Input Output Transition Systems In the following we present a formal definition of what we call Extended Input- Output Transition System (EIOTS), inspired from the Input Output symbolic Transi- tion System IOSTS in [RBJ00], I/O Automata [LyTu89], and CSP [Hoar85]. An EI...
The meaning of negative premises in transition system specifications (extended abstract) This paper reviews several methods to associate transition relations to transition system specifications with negative premises in Plotkin's structural ope... RN Bol,JF Groote - International Colloquium on Automata, ...
We first consider T-algebras which are equipped with a transition structure similar to that of Moore automata but which, in addition, preserves the algebraic structure. Such a transition structure extends a T- algebra with dynamic behaviour (making it into a coalgebra) and hence we call such ...
Techniques, such as Cellular Automata (CA), as rule-based models construct a 'bottom-up' approach, where the structure evolves from a Moran neighborhood interacting between neighboring cells using different types of transition rules [31,39–41]. Moreover, the conventional urban CA model assumption...