A Process-Theoretic Look at Automata (original) (raw)
Related papers
Bisimulation Equivalence Is Decidable for All Context-Free Processes
Information and Computation, 1995
Silence is golden: Branching bisimilarity is decidable for context-free processes
Lecture Notes in Computer Science, 1992
A Context-Free Process as a Pushdown Automaton
International Conference on Concurrency Theory, 2008
Nondeterministic automata: equivalence, bisimulations, and uniform relations
Computing Research Repository, 2011
Information and Computation, 1988
Equivalent Transformations of Automata by Using Behavioural Automata
Standard Automata Theory and Process Algebra
arXiv (Cornell University), 2022
IFIP International Federation for Information Processing, 2004
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM, 1993
The Complexity of Deciding Behavioural Equivalences and Preorders
1996
Process Equivalences as Global Bisimulations1
Journal of Universal Computer …, 2006
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
Lecture Notes in Computer Science, 2002
Process Equivalences as Global Bisimulations
Zenodo (CERN European Organization for Nuclear Research), 2006
Undecidable equivalences for basic parallel processes
Information and Computation, 2009
xiii + 412 pp. Michael A. Arbib, ,Theories of Abstract Automata (1969) Prentice-Hall,Providence, RI
1971
Deciding Bisimulation-Like Equivalences with Finite-State Processes
1999
Decidability, behavioural equivalences and infinite transition graphs
1991
The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy
Bisimulation equivalence is decidable for basic parallel processes
Lecture Notes in Computer Science, 1993
Mathematical Structures in Computer Science, 1998
A Basic Parallel Process as a Parallel Pushdown Automaton
Electronic Notes in Theoretical Computer Science, 2009
1998
Process theory based on bisimulation semantics
1989
Actions speak louder than words: Proving bisimilarity for context-free processes
1991
Refining the Undecidability Border of Weak Bisimilarity
Jan Strejček, Mojmír Křetínský
Electronic Notes in Theoretical Computer Science, 2006
On the Expressiveness and Decidability of Higher-Order Process Calculi
2008
An Algebra of Behavioural Types
Information and Computation, 2012
On the Complexity of Deciding Behavioural Equivalences and Preorders. A Survey
BRICS Report Series, 1996
2009
Process Algebra as Abstract Data Types
arXiv (Cornell University), 2010
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes
Theory of Computing Systems, 2013
The algorithmics of bisimilarity
Advanced Topics in Bisimulation and Coinduction
On the decidability of process equivalences for the π-calculus
Theoretical Computer Science, 1997
On the properties of language classes defined by bounded reaction automata
Theoretical Computer Science, 2012