scientific article; zbMATH DE number 1304991
From MaRDI portal
zbMath0932.68052MaRDI QIDQ4251913
Philippe Schnoebelen, Denis Lugiez
Publication date: 23 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items
Efficiency of automata in semi-commutation verification techniques, Verifying parallel programs with dynamic communication structures, On the Reachability Analysis of Acyclic Networks of Pushdown Systems, Unnamed Item, An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems, Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism, Decidability of model checking with the temporal logic EF, Deciding bisimulation-like equivalences with finite-state processes, Verifying Parallel Programs with Dynamic Communication Structures, Reachability is decidable for weakly extended process rewrite systems, Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order, Cryptographic Analysis in Cubic Time, Iterating transducers, On Symbolic Verification of Weakly Extended PAD, Dynamic connectors for concurrency
