Axiomatizing weak ready simulation semantics over BCCSP (original) (raw)
Related papers
Axiomatizing weak simulation semantics over BCCSP
Theoretical Computer Science, 2013
Information Processing Letters, 2011
The Equational Theory of Weak Complete Simulation Semantics over BCCSP
Lecture Notes in Computer Science, 2012
(Bi)simulations up-to characterise process semantics
Information and Computation, 2009
Mathematical Structures in Computer Science, 1998
On the axiomatizability of ready traces, ready simulation, and failure traces
Automata, Languages and Programming, 2003
Ready to preorder: The case of weak process semantics
Information Processing Letters, 2008
Trace Simulation Semantics is not Finitely Based over BCCSP
Acta Cybernetica, 2017
Simulation preorder over simple process algebras
Information and Computation, 2002
Simulations Up-to and Canonical Preorders
Electronic Notes in Theoretical Computer Science, 2007
Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations
Electronic Notes in Theoretical Computer Science, 2008
Universal Coinductive Characterisations of Process Semantics
IFIP International Federation for Information Processing, 2008
A cook's tour of equational axiomatizations for prefix iteration
Lecture Notes in Computer Science, 1998
On the Unification of Process Semantics: Equational Semantics
Electronic Notes in Theoretical Computer Science, 2009
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
Electronic Notes in Theoretical Computer Science, 2008
Finite equational bases in process algebra: Results and open questions
Processes, Terms and Cycles: Steps on the Road to Infinity, 2005
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence
2008
Logic and Logical Philosophy, 2013
A weakest precondition semantics for communicating processes
Decision Support Systems, 1985
Priority and abstraction in process algebra
Foundation of Software …, 1994
On the Axiomatizability of Priority
2006
On the axiomatisability of priority
Mathematical Structures in Computer Science, 2008
On Finite Bases for Weak Semantics: Failures versus Impossible Futures
Computing Research Repository, 2008
Denotational Semantics for Process-Based Simulation Languages. Part II
1998
Characteristic formulae for fixed-point semantics: a general framework
Mathematical Structures in Computer Science, 2012
2-Nested Simulation Is Not Finitely Equationally Axiomatizable
Lecture Notes in Computer Science, 2001
A Complete Equational Axiomatization for BPAδε with Prefix Iteration
2016
On the axiomatizability of priority II
Theoretical Computer Science, 2011