Sciweavers

20126 search results - page 133 / 4026
» Timed Transition Systems
Sort
View
117
Voted
FORTE
2001
15 years 4 months ago
Implementing a Modal Logic over Data and Processes using XTL
The modal logic FULL is designed to capture strong bisimulation over early symbolic transition systems (STSs) for full LOTOS. It provides a compact way of expressing and verifying ...
Jeremy Bryans, Carron Shankland
ACSD
2009
IEEE
117views Hardware» more  ACSD 2009»
15 years 10 months ago
Petrifying Operating Guidelines for Services
Abstract. Operating guidelines characterize correct interaction (e.g. deadlock freedom) with a service. They can be stored in a service registry. So far, they have been represented...
Niels Lohmann, Karsten Wolf
106
Voted
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
15 years 10 months ago
Sensitivity analysis and computational uncertainty with applications to control of nonlinear parabolic partial differential equa
— In this paper we illustrate how sensitivities can be used to provide a practical precursor to dynamic transitions and numerical uncertainty in parameterized nonlinear parabolic...
John A. Burns, Lisa G. Davis
109
Voted
STACS
2005
Springer
15 years 9 months ago
Deciding Properties of Contract-Signing Protocols
Abstract. We show that for infinite transition systems induced by cryptographic protocols in the Rusinowitch/Turuani style certain fundamental branching properties are decidable. ...
Detlef Kähler, Ralf Küsters, Thomas Wilk...
AMAST
2004
Springer
15 years 8 months ago
Expressing Iterative Properties Logically in a Symbolic Setting
We present a logic for reasoning about LOTOS behaviours which allows properties involving repeated patterns over actions and data to be expressed. The semantics of the logic is giv...
Carron Shankland, Jeremy Bryans, Lionel Morel