Bisimulation of automata

DOI10.1016/0890-5401(88)90017-XzbMath0679.68111MaRDI QIDQ1822987

Ofer Ben-Shachar, David B. Benson

Publication date: 1988

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

automatonpure epimorphism(weak) bisimulation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Categories of machines, automata (18B20)

Related Items (5)

Morphisms and Minimisation of Weighted Automata ⋮ Convenient category of processes and simulations I: Modulo strong bisimilarity ⋮ An algebraic characterization of observational equivalence ⋮ CCS expressions, finite state processes, and three problems of equivalence ⋮ Petri nets and bisimulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The inverse semigroup of a sum-ordered semiring
• Calculi for synchrony and asynchrony
• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• Fixed points in free process algebras. I
• On modules over a semiring
• An abstract machine theory for formal language parsers
• Functional behavior of nondeterministic and concurrent programs
• Process algebra for synchronous communication
• Algebraic laws for nondeterminism and concurrency
• Machines in a Category: An Expository Introduction
• Categories of semimodules: The categorical structural properties of transition systems
• Realization is universal

This page was built for publication: Bisimulation of automata