100 search results - page 3 / 20 » Linear-Time Model Checking: Automata Theory in Practice |
94
Voted
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
115
Voted
SPIN
2001
Springer
15 years 2 months ago
2001
Springer
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
100
Voted
ATVA
2009
Springer
15 years 4 months ago
2009
Springer
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
156
click to vote
LICS
2003
IEEE
15 years 3 months ago
2003
IEEE
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
65
Voted
FCT
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...