Sciweavers

815 search results - page 80 / 163
» Algebraic Recognizability of Languages
Sort
View
ESOP
2007
Springer
16 years 9 days ago
CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements
Abstract. Service Level Agreements are a key issue in Service Oriented Computing. SLA contracts specify client requirements and service guarantees, with emphasis on Quality of Serv...
Maria Grazia Buscemi, Ugo Montanari
TAPSOFT
1997
Springer
15 years 10 months ago
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
Danièle Beauquier, Anatol Slissenko
CIDR
2009
98views Algorithms» more  CIDR 2009»
15 years 7 months ago
From Declarative Languages to Declarative Processing in Computer Games
Recent work has shown that we can dramatically improve the performance of computer games and simulations through declarative processing: Character AI can be written in an imperati...
Ben Sowell, Alan J. Demers, Johannes Gehrke, Nitin...
ACTA
2007
126views more  ACTA 2007»
15 years 6 months ago
The syntactic monoid of hairpin-free languages
The study of hairpin-free words has been initiated in the context of DNA computing. DNA strands that, theoretically speaking, are finite strings over the alphabet {A, G, C, T} are...
Lila Kari, Kalpana Mahalingam, Gabriel Thierrin
CSL
2006
Springer
15 years 9 months ago
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
Jirí Srba