Sciweavers

378 search results - page 63 / 76
» Formalizing Spider Diagrams
Sort
View
134
Voted
EMSOFT
2006
Springer
15 years 8 months ago
Polychronous mode automata
Among related synchronous programming principles, the model of computation of the Polychrony workbench stands out by its capability to give high-level description of systems where...
Jean-Pierre Talpin, Christian Brunette, Thierry Ga...
FMICS
2006
Springer
15 years 8 months ago
Can Saturation Be Parallelised?
Abstract. Symbolic state-space generators are notoriously hard to parallelise. However, the Saturation algorithm implemented in the SMART verification tool differs from other seque...
Jonathan Ezekiel, Gerald Lüttgen, Radu Simini...
CAISE
2009
Springer
15 years 8 months ago
The Problem of Transitivity of Part-Whole Relations in Conceptual Modeling Revisited
Abstract. Parthood is a relation of fundamental importance in a number of disciplines including cognitive science, linguistics and conceptual modeling. However, one classical probl...
Giancarlo Guizzardi
APSEC
2008
IEEE
15 years 6 months ago
A Verification Framework for FBD Based Software in Nuclear Power Plants
Formal verification of Function Block Diagram (FBD) based software is an essential task when replacing traditional relay-based analog system with PLC-based software in nuclear rea...
Junbeom Yoo, Sung Deok Cha, Eunkyoung Jee
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
15 years 3 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki