Creating modular behaviours in JADE using a traditional method such as the FSM (Finite State Machine) can be a difficult task to achieve. The first issue with FSMs is that they do...
Iva Bojic, Tomislav Lipic, Mario Kusek, Gordan Jez...
We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-ord...
For undiscounted two-person zero-sum communicating stochastic games with finite state and action spaces, a solution procedure is proposed that exploits the communication property,...
Workflow technology has met with success in a variety of industries, although several limitations have emerged. One such drawback is the inflexibility of specification languages, ...
Belinda M. Carter, Joe Y.-C. Lin, Maria E. Orlowsk...
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...