5 search results - page 1 / 1 » Temporal Logic Constraints in the Biochemical Abstract Machi... |
LOPSTR
2005
Springer
13 years 10 months ago
2005
Springer
ICLP
2009
Springer
14 years 5 months ago
2009
Springer
In this paper, we study the modelization of biochemical reaction by using concurrent constraint programming idioms. In particular we will consider the stochastic concurrent constra...
KBSE
2008
IEEE
13 years 11 months ago
2008
IEEE
Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation ...
CAV
1998
Springer
13 years 9 months ago
1998
Springer
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
ICTAC
2004
Springer
13 years 10 months ago
2004
Springer
Among the possible approaches for expressing real-time problems with the B method, two are dominant : the use of the usual B mechanisms to define temporal constraints on the one h...