160 search results - page 2 / 32 » Modeling, specification, and verification of automaton progr... |
ENTCS
2006
15 years 1 months ago
2006
Increasing attention has been paid recently to criteria that allow one to conclude that a structure models a linear-time property from the knowledge that no counterexamples exist ...
101
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
129
click to vote
HASE
1999
IEEE
15 years 5 months ago
1999
IEEE
Statechart Diagrams provide a graphical notation for describing dynamic aspects of system behaviour within the Unified Modeling Language (UML). In this paper we present a branchin...
102
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...
153
click to vote
KBSE
2003
IEEE
15 years 6 months ago
2003
IEEE
Physics-based animation programs can often be modeled in terms of hybrid automata. A hybrid automaton includes both discrete and continuous dynamical variables. The discrete varia...