Sciweavers

27 search results - page 3 / 6
» Strong Splitting Bisimulation Equivalence
Sort
View
CONCUR
2003
Springer
13 years 11 months ago
Comparative Branching-Time Semantics
d Abstract) Christel Baier1 , Holger Hermanns2,3 , Joost-Pieter Katoen2 , and Verena Wolf1 1 Institut f¨ur Informatik I, University of Bonn R¨omerstraße 164, D-53117 Bonn, Germa...
Christel Baier, Holger Hermanns, Joost-Pieter Kato...
CBSE
2008
Springer
13 years 7 months ago
State Space Reduction Techniques for Component Interfaces
Abstract. Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software...
Markus Lumpe, Lars Grunske, Jean-Guy Schneider
FOSSACS
2009
Springer
14 years 17 days ago
Bisimulation for Demonic Schedulers
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...
Konstantinos Chatzikokolakis, Gethin Norman, David...
SAS
1999
Springer
124views Formal Methods» more  SAS 1999»
13 years 10 months ago
State Space Reduction Based on Live Variables Analysis
The intrinsic complexity of most protocol speci cations in particular, and of asynchronous systems in general, lead us to study combinations of static analysis with classical model...
Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu
ATVA
2004
Springer
146views Hardware» more  ATVA 2004»
13 years 11 months ago
A Global Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
Tadaaki Tanimoto, Suguru Sasaki, Akio Nakata, Teru...