LCS Technical Memos (1974 - 2003): Recent submissions
Now showing items 325-327 of 486
-
Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness
(1981-01)Let p be a formular in deterministic propositional dynamic logic. A decision procedure for the satisfiability of p is given along with a construction of a finite model for every satisifiable p. The decision procedure runs ... -
Persistence of Vector Replacement Systems is Decidable
(1981-01)In a persistent vector replacement system (VRS) or Petri net, an enabled transition can become disabled only by firing itself. Here, an algorithm is presented which allows to decide whether an arbitrary VRS is persistent ... -
An Effective Representation of the Reachability Set of Persistent Petri Nets
(1981-01)In a persistent Petri net, an enabled transition can become disabled only by firing itself. Here, an algorithm is presented which constructs a semilinear representation of the set of states reachable in an arbitrary ...
