Sciweavers

1012 search results - page 62 / 203
» Process Algebra with Backtracking
Sort
View
ARTS
1997
Springer
14 years 1 days ago
Regular Processes and Timed Automata
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...
Pedro R. D'Argenio
ENTCS
2010
133views more  ENTCS 2010»
13 years 8 months ago
Towards Measurable Types for Dynamical Process Modeling Languages
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
Eric Mjolsness
TASE
2008
IEEE
14 years 2 months ago
Bounded Model Checking of Compositional Processes
Verification techniques like SAT-based bounded model checking have been successfully applied to a variety of system models. Applying bounded model checking to compositional proce...
Jun Sun 0001, Yang Liu 0003, Jin Song Dong, Jing S...
EDBT
2008
ACM
159views Database» more  EDBT 2008»
14 years 8 months ago
Automaton in or out: run-time plan optimization for XML stream processing
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
Hong Su, Elke A. Rundensteiner, Murali Mani
ENTCS
2002
101views more  ENTCS 2002»
13 years 7 months ago
A categorical framework for typing CCS-style process communication
Category theory has proved a useful tool in the study of type systems for sequential programming languages. Various approaches have been proposed to use categorical models to exam...
Ralf Schweimeier