Sciweavers

4340 search results - page 503 / 868
» Formal Methods and Cryptography
Sort
View
SFM
2004
Springer
120views Formal Methods» more  SFM 2004»
16 years 2 days ago
Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing)
We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other va...
Jos C. M. Baeten, Michel A. Reniers
SFM
2004
Springer
16 years 2 days ago
Embedded Software Analysis with MOTOR
This paper surveys the language Modest, a Modelling and Description language for Stochastic and Timed systems, and its accompanying tool-environment MOTOR. The language and tool ar...
Joost-Pieter Katoen, Henrik C. Bohnenkamp, Ric Kla...
CAV
2003
Springer
154views Hardware» more  CAV 2003»
15 years 12 months ago
Structural Symbolic CTL Model Checking of Asynchronous Systems
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...
Gianfranco Ciardo, Radu Siminiceanu
EGOV
2003
Springer
15 years 12 months ago
Structuring Dialogue between the People and Their Representatives
Conversations between citizens and their representatives may take a number of forms. In this paper, we consider one of these — letters between citizens and representatives — an...
Katie Greenwood, Trevor J. M. Bench-Capon, Peter M...
FM
2003
Springer
89views Formal Methods» more  FM 2003»
15 years 12 months ago
Team Automata Satisfying Compositionality
A team automaton is said to satisfy compositionality if its behaviour can be described in terms of the behaviour of its constituting component automata. As an initial investigation...
Maurice H. ter Beek, Jetty Kleijn