Sciweavers

20126 search results - page 55 / 4026
» Timed Transition Systems
Sort
View
IFIP
2005
Springer
15 years 3 months ago
Opacity Generalised to Transition Systems
Recently, opacity has proved to be a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of...
Jeremy Bryans, Maciej Koutny, Laurent Mazaré...
COOPIS
2004
IEEE
15 years 1 months ago
Checking Asynchronously Communicating Components Using Symbolic Transition Systems
Abstract. Explicit behavioural interface description languages (BIDLs, protocols) are now recognized as a mandatory feature of component languages in order to address component reu...
Olivier Maréchal, Pascal Poizat, Jean-Claud...
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
15 years 3 months ago
Unfolding Concurrent Well-Structured Transition Systems
Abstract. Our main objective is to combine partial-order methods with verification techniques for infinite-state systems in order to obtain efficient verification algorithms fo...
Frédéric Herbreteau, Grégoire...
VMCAI
2012
Springer
13 years 5 months ago
Ideal Abstractions for Well-Structured Transition Systems
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...
Damien Zufferey, Thomas Wies, Thomas A. Henzinger
CALCO
2005
Springer
69views Mathematics» more  CALCO 2005»
15 years 3 months ago
From T-Coalgebras to Filter Structures and Transition Systems
Abstract. For any set-endofunctor T : Set → Set there exists a largest subcartesian transformation µ to the filter functor F : Set → Set. Thus we can associate with every T-c...
H. Peter Gumm