Sciweavers

ACTA
2004
97views more  ACTA 2004»
13 years 11 months ago
Past is for free: on the complexity of verifying linear temporal properties with past
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
Nicolas Markey
ACTA
2004
87views more  ACTA 2004»
13 years 11 months ago
P systems with symport/antiport simulating counter automata
The generative capability of several variants of P systems with symport/antiport is studied via the simulation of counter automata. This leads to the reduction of the complexity, e...
Pierluigi Frisco, Hendrik Jan Hoogeboom
ACTA
2004
67views more  ACTA 2004»
13 years 11 months ago
Trajectory-based codes
Michael Domaratzki
ACTA
2004
102views more  ACTA 2004»
13 years 11 months ago
Approximation schemes for the Min-Max Starting Time Problem
Leah Epstein, Tamir Tassa
ACTA
2004
86views more  ACTA 2004»
13 years 11 months ago
Specification transformers: a predicate transformer approach to composition
Abstract. This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and ...
Michel Charpentier, K. Mani Chandy
ACTA
2004
106views more  ACTA 2004»
13 years 11 months ago
Trading polarizations for labels in P systems with active membranes
Abstract. This paper addresses the problem of removing the polarizations of membranes from P systems with active membranes
Artiom Alhazov, Linqiang Pan, Gheorghe Paun