The following pages link to Acta Informatica (Q161641):
Displaying 50 items.
- Special issue on temporal representation and reasoning (TIME'13) (Q262127) (← links)
- Efficient execution of dynamically controllable simple temporal networks with uncertainty (Q262129) (← links)
- Optimization in temporal qualitative constraint networks (Q262133) (← links)
- A tool for deciding the satisfiability of continuous-time metric temporal logic (Q262137) (← links)
- A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases (Q266861) (← links)
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- Metric temporal logic revisited (Q266865) (← links)
- Special issue on rich models, EU-COST action IC0901 rich-model toolkit (Q300403) (← links)
- Symbolic automata for representing big code (Q300407) (← links)
- Verification of heap manipulating programs with ordered data by extended forest automata (Q300414) (← links)
- Guiding Craig interpolation with domain-specific abstractions (Q300418) (← links)
- Synthesizing efficient systems in probabilistic environments (Q300419) (← links)
- Optimal covers in the relational database model (Q303689) (← links)
- Concurrent abstract state machines (Q303691) (← links)
- A linear-time algorithm for the orbit problem over cyclic groups (Q303693) (← links)
- On reversible Turing machines and their function universality (Q303695) (← links)
- Special issue: Selected papers from the 21st international symposium on temporal representations and reasoning (TIME-2014) (Q329408) (← links)
- Mining approximate interval-based temporal dependencies (Q329410) (← links)
- Checking interval properties of computations (Q329413) (← links)
- Metric propositional neighborhood logic with an equivalence relation (Q329414) (← links)
- Planning and execution with flexible timelines: a formal account (Q329417) (← links)
- Dynamic controllability via timed game automata (Q329422) (← links)
- Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification (Q329426) (← links)
- A distributed resource allocation algorithm for many processes (Q378202) (← links)
- New proof for the undecidability of the circular PCP (Q378203) (← links)
- Online multi-coloring on the path revisited (Q378204) (← links)
- General quantitative specification theories with modal transition systems (Q404008) (← links)
- Forward and backward application of symbolic tree transducers (Q404011) (← links)
- Controlled finite automata (Q404012) (← links)
- Some kinds of primitive and non-primitive words (Q466915) (← links)
- Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
- On the incremental growth and shrinkage of LR goto-graphs (Q471185) (← links)
- Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Trace- and failure-based semantics for responsiveness (Q478516) (← links)
- Head and state hierarchies for unary multi-head finite automata (Q478518) (← links)
- Some properties of involution binary relations (Q493117) (← links)
- Contextual hyperedge replacement (Q493120) (← links)
- Parametrized invariance for infinite state processes (Q493122) (← links)
- Special issue: Selected papers from the 26th international conference on concurrency theory (CONCUR 2015) (Q520337) (← links)
- Reactive synthesis without regret (Q520338) (← links)
- Assume-admissible synthesis (Q520340) (← links)
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games (Q520343) (← links)
- A general account of coinduction up-to (Q523132) (← links)
- Verification of population protocols (Q523133) (← links)
- Dynamic Bayesian networks for formal verification of structured stochastic processes (Q523135) (← links)
- Compositional schedulability analysis of real-time actor-based systems (Q530212) (← links)
- Disjunctivity and other properties of sets of pseudo-bordered words (Q530214) (← links)
- Regular and context-free nominal traces (Q530218) (← links)
- Efficiently solving the bin packing problem through bio-inspired mobility (Q530219) (← links)
