Infinite results

DOI10.1007/3-540-61604-7_56zbMath1514.68176OpenAlexW2912614885WikidataQ59557002 ScholiaQ59557002MaRDI QIDQ6104374

Faron Moller

Publication date: 28 June 2023

Published in: CONCUR '96: Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61604-7_56

Mathematics Subject Classification ID

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

Related Items (25)

A generic framework for checking semantic equivalences between pushdown automata and finite-state automata ⋮ Simulation relations and applications in formal methods ⋮ Undecidable problems in unreliable computations. ⋮ An algebra of behavioural types ⋮ Unnamed Item ⋮ A Context-Free Process as a Pushdown Automaton ⋮ Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity ⋮ Complexity of Weak Bisimilarity and Regularity for BPA and BPP ⋮ Decidability of Weak Bisimilarity for a Subset of BPA ⋮ Petri nets are less expressive than state-extended PA ⋮ A Basic Parallel Process as a Parallel Pushdown Automaton ⋮ On the computational complexity of bisimulation, redux ⋮ Pushdown automata, multiset automata, and Petri nets ⋮ Nonprimitive recursive complexity and undecidability for Petri net equivalences ⋮ Decidability of model checking with the temporal logic EF ⋮ Well-structured transition systems everywhere! ⋮ Deciding bisimulation-like equivalences with finite-state processes ⋮ On the complexity of the linear-time μ-calculus for Petri Nets ⋮ Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time ⋮ The regular viewpoint on PA-processes ⋮ Basic process algebra with deadlocking states ⋮ Reachability is decidable for weakly extended process rewrite systems ⋮ Decidability of bisimulation equivalence for normed pushdown processes ⋮ Decidable first-order transition logics for PA-processes ⋮ Process rewrite systems.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the regular structure of prefix rewriting
• A complete inference system for a class of regular behaviours
• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• Finite representations of CCS and TCSP programs by automata and Petri nets
• A short proof of the decidability of bisimulation for normed BPA- processes
• Unique decomposition of processes
• Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
• Undecidable equivalences for basic process algebra
• A polynomial algorithm for deciding bisimilarity of normed context-free processes
• On deciding readiness and failure equivalences for processes
• Bisimulation equivalence is decidable for all context-free processes
• Decidability of bisimulation equivalence for process generating context-free languages
• Graphes canoniques de graphes algébriques
• An elementary bisimulation decision procedure for arbitrary context-free processes
• An Algorithm for the General Petri Net Reachability Problem
• A fast algorithm to decide on the equivalence of stateless DPDA
• Two Complete Axiom Systems for the Algebra of Regular Events

This page was built for publication: Infinite results