Sciweavers

86 search results - page 6 / 18
» Timed Diagnostics for Reachability Properties
Sort
View
RTSS
1998
IEEE
13 years 12 months ago
Membership Questions for Timed and Hybrid Automata
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
Rajeev Alur, Robert P. Kurshan, Mahesh Viswanathan
ENTCS
2006
125views more  ENTCS 2006»
13 years 7 months ago
Liveness Checking as Safety Checking for Infinite State Spaces
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Viktor Schuppan, Armin Biere
QEST
2009
IEEE
14 years 2 months ago
The Ins and Outs of the Probabilistic Model Checker MRMC
The Markov Reward Model Checker (MRMC) is a software tool for verifying properties over probabilistic models. It supports PCTL and CSL model checking, and their reward extensions....
Joost-Pieter Katoen, Ivan S. Zapreev, Ernst Moritz...
APN
2007
Springer
14 years 1 months ago
A Compositional Method for the Synthesis of Asynchronous Communication Mechanisms
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...
Kyller Costa Gorgônio, Jordi Cortadella, Fei...
IPPS
2007
IEEE
14 years 2 months ago
Formal Analysis of Time-Dependent Cryptographic Protocols in Real-Time Maude
This paper investigates the suitability of applying the general-purpose Real-Time Maude tool to the formal specification and model checking analysis of timedependent cryptographi...
Peter Csaba Ölveczky, Martin Grimeland