Sciweavers

411 search results - page 46 / 83
» Timed Alternating-Time Temporal Logic
Sort
View
FUIN
2007
116views more  FUIN 2007»
13 years 9 months ago
Path Compression in Timed Automata
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
Agata Janowska, Wojciech Penczek
ECAI
2010
Springer
13 years 11 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
14 years 3 months ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
FSTTCS
2010
Springer
13 years 7 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
CONCUR
2010
Springer
13 years 11 months ago
Modal Logic over Higher Dimensional Automata
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...
Cristian Prisacariu