The goal of the paper is to explicate some common formal logic underlying various notational systems used in visual modeling. The idea is to treat the notational diversity as the d...
Zinovy Diskin, Boris Kadish, Frank Piessens, Micha...
We make the case that Discrete Event System Speci cation DEVS is a universal formalismfor discrete event dynamical systems DEDS. DEVS o ers an expressive framework for modelling, ...
Bernard P. Zeigler, Hae Sang Song, Tag Gon Kim, He...
This paper presents a case study for automatic verification using the Communicating Sequential Processes formalism. The case study concerns the Futurebus+ cache coherency standard...
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...