Sciweavers

43 search results - page 4 / 9
» Towards Action-Refinement in Process Algebras
Sort
View
ICIP
2007
IEEE
14 years 9 months ago
Dart: A Fast Heuristic Algebraic Reconstruction Algorithm for Discrete Tomography
Discrete tomography (DT) is concerned with the tomographic reconstruction of images that consist of only a small number of gray levels. DT reconstruction problems are usually unde...
Kees Joost Batenburg, Jan Sijbers
IPPS
2003
IEEE
14 years 22 days ago
Towards a Theory of Bisimulation for a Fragment of Verilog
In this paper, we have developed an operational semantic framework for a non-trival subset of Verilog which features event–driven computation, shared variable concurrency. The b...
Li Yongjian, Jifeng He
NCA
2008
IEEE
14 years 1 months ago
On the Application of Formal Methods for Specifying and Verifying Distributed Protocols
In this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the tw...
Marina Gelastou, Chryssis Georgiou, Anna Philippou
DEXAW
2004
IEEE
181views Database» more  DEXAW 2004»
13 years 11 months ago
Algebraic Optimization of Data Delivery Patterns in Mobile Sensor Networks
Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among ...
Vladimir Zadorozhny, Panos K. Chrysanthis, Alexand...
ENTCS
2006
141views more  ENTCS 2006»
13 years 7 months ago
Refining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
Mojmír Kretínský, Vojtech Reh...