656 search results - page 38 / 132 » A Formalization of Transition P Systems |
106
Voted
HYBRID
2010
Springer
14 years 10 months ago
2010
Springer
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...
FORMATS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be a...
101
Voted
CAV
2003
Springer
15 years 5 months ago
2003
Springer
In previous work, we showed how structural information can be used to efficiently generate the state-space of asynchronous systems. Here, we apply these ideas to symbolic CTL model...
99
Voted
IANDC
2006
15 years 18 days ago
2006
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
98
Voted
JLP
2006
15 years 17 days ago
2006
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpreta...