Sciweavers

19 search results - page 1 / 4
» Testing Hennessy-Milner Logic with Recursion
Sort
View
FOSSACS
1999
Springer
13 years 9 months ago
Testing Hennessy-Milner Logic with Recursion
Luca Aceto, Anna Ingólfsdóttir
ENTCS
2007
69views more  ENTCS 2007»
13 years 5 months ago
Modal Logic Characterization of Markovian Testing and Trace Equivalences
Markovian testing and trace equivalences have been recently proposed as reasonable alternatives to Markovian bisimilarity, as both of them induce at the Markov chain level an aggr...
Marco Bernardo, Stefania Botta
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
13 years 7 months ago
Computation Tree Regular Logic for Genetic Regulatory Networks
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
Radu Mateescu, Pedro T. Monteiro, Estelle Dumas, H...
CADE
2011
Springer
12 years 5 months ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
POPL
2010
ACM
14 years 2 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts