656 search results - page 79 / 132 » A Formalization of Transition P Systems |
119
Voted
TOOLS
2000
IEEE
15 years 4 months ago
2000
IEEE
UML is widely used today for modelling complex systems. However, the tools support capabilities for UML is limited, partially due to its lack of precise semantics. There are some ...
100
Voted
TAPSOFT
1997
Springer
15 years 4 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
127
Voted
JELIA
1994
Springer
15 years 4 months ago
1994
Springer
: In this paper we describe a general way of formalizing reasoning behaviour. Such a behaviour may be described by all the patterns which are valid for the behaviour. A pattern can...
113
Voted
FMCAD
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
ISCAS
2006
IEEE
15 years 6 months ago
2006
IEEE
In recent times, much attention has been devoted to power optimization for real-time systems, while guaranteeing that such systems meet their hard (or soft) scheduling deadlines. ...