Sciweavers

199 search results - page 24 / 40
» A Fully Abstract Model for Graph-Interpreted Temporal Logic
Sort
View
124
Voted
ICLP
2010
Springer
15 years 5 months ago
A Logical Paradigm for Systems Biology (Invited Talk)
[6]. An SBML model can be interpreted in Biocham at three abstraction levels: • the Boolean semantics (asynchronuous Boolean state transitions on the presence/absence of molecule...
François Fages
HYBRID
2003
Springer
15 years 7 months ago
Model Checking LTL over Controllable Linear Systems Is Decidable
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
Paulo Tabuada, George J. Pappas
IFIP
2004
Springer
15 years 7 months ago
Static program transformations for efficient software model checking
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checkers from the state space exp...
Shobha Vasudevan, Jacob A. Abraham
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
15 years 8 months ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
112
Voted
ISCIS
2004
Springer
15 years 7 months ago
Semi-formal and Formal Models Applied to Flexible Manufacturing Systems
Abstract. Flexible Manufacturing Systems (FMSs) are adopted to process different goods in different mix ratios allowing firms to react quickly and efficiently to changes in produ...
Andrea Matta, Carlo A. Furia, Matteo Rossi