Confluence for process verification

DOI10.1016/S0304-3975(96)80702-XzbMath0874.68118OpenAlexW2911867855MaRDI QIDQ672042

M. P. A. Sellink, Jan Friso Groote

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)80702-x

zbMATH Keywords

linear processesconfluencetransition systemsstate space reduction\(\tau\)-inertnessprocess verification

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (22)

Characteristic bisimulation for higher-order session processes ⋮ Compositional verification of concurrent systems by combining bisimulations ⋮ A theory for observational fault tolerance ⋮ On confluence in the π-calculus ⋮ Formal verification of a leader election protocol in process algebra ⋮ Analysis of a distributed system for lifting trucks. ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Cartesian difference categories ⋮ Exponential automatic amortized resource analysis ⋮ Sequential and distributed on-the-fly computation of weak tau-confluence ⋮ Unnamed Item ⋮ Linear logical relations and observational equivalences for session-based concurrency ⋮ Using bisimulation proof techniques for the analysis of distributed abstract machines ⋮ Confluence Reduction for Probabilistic Systems ⋮ Confluence reduction for Markov automata ⋮ On the Origin of Events: Branching Cells as Stubborn Sets ⋮ Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities ⋮ Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems ⋮ Recursive equations in higher-order process calculi ⋮ Weak confluence and \(\tau\)-inertness ⋮ Consistently-detecting monitors ⋮ Compositional State Space Reduction Using Untangled Actions

Cites Work

• A calculus of communicating systems
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• An algebraic characterization of transition system equivalences
• A partial order approach to branching time logic model checking.
• Process Algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Confluence for process verification