scientific article; zbMATH DE number 1059894

zbMath0882.68101MaRDI QIDQ4353915

Javier Esparza

Publication date: 10 September 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Petri netsbasic parallel processescommutative context-free grammars

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (28)

Parikh’s Theorem and Descriptional Complexity ⋮ Petri Nets and Semilinear Sets (Extended Abstract) ⋮ Context-free commutative grammars with integer counters and resets ⋮ Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata ⋮ Structural Liveness of Immediate Observation Petri Nets ⋮ Unboundedness problems for machines with reversal-bounded counters ⋮ Parikh's theorem: a simple and direct automaton construction ⋮ Tableau methods for PA-processes ⋮ Honesty by Typing ⋮ Behavioural equivalence for infinite systems — Partially decidable! ⋮ Timed Basic Parallel Processes ⋮ Reachability in Parameterized Systems: All Flavors of Threshold Automata ⋮ A practical approach to model checking duration calculus using Presburger arithmetic ⋮ An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems ⋮ Decidability of Weak Bisimilarity for a Subset of BPA ⋮ A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application ⋮ Decidability of branching bisimulation on normed commutative context-free processes ⋮ Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences ⋮ The regular viewpoint on PA-processes ⋮ Unnamed Item ⋮ A theory of structural stationarity in the \(\pi\)-calculus ⋮ Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes ⋮ The Parikh Property for Weighted Context-Free Grammars ⋮ Flatness and Complexity of Immediate Observation Petri Nets ⋮ Bisimilarity on basic parallel processes ⋮ Non-interleaving bisimulation equivalences on basic parallel processes ⋮ Decidable first-order transition logics for PA-processes ⋮ Characterization and complexity results on jumping finite automata

This page was built for publication: