Characteristic formulae for fixed-point semantics: a general framework (original) (raw)
Related papers
Bisimulation Equivalence Is Decidable for All Context-Free Processes
Information and Computation, 1995
An action-based framework for veryfying logical and behavioural properties of concurrent systems
Computer Networks and ISDN Systems, 1993
Verification of Temporal Properties of Concurrent Systems
DAIMI Report Series, 1993
Process Equivalences as Global Bisimulations1
Journal of Universal Computer …, 2006
Process Equivalences as Global Bisimulations
Zenodo (CERN European Organization for Nuclear Research), 2006
Bisimulation equivalence is decidable for basic parallel processes
Lecture Notes in Computer Science, 1993
Axiomatization of Bisimulation Based Relations
2005
Characteristic formulae: from automata to logic
2007
Deciding Bisimulation-Like Equivalences with Finite-State Processes
1999
Process theory based on bisimulation semantics
1989
Mathematical Structures in Computer Science, 1998
Reasoning about Nondeterministic and Concurrent Actions: A Process Algebra Approach
Undecidable equivalences for basic parallel processes
Information and Computation, 2009
On the decidability of process equivalences for the π-calculus
Theoretical Computer Science, 1997
Priority and abstraction in process algebra
Foundation of Software …, 1994
On Semantics of Concurrency and Nondeterminism: Bisimulations and Temporal Logics
Electronic Notes in Theoretical Computer Science, 1998
Journal of Logic, Language and Information, 1994
1989
Translation Results for Modal Logics of Reactive Systems
Workshops in Computing, 1994
Towards Action-Refinement in Process Algebras
Information and Computation, 1993
Logic Based Abstractions of Real-Time Systems
2000
Modal Logic, Transition Systems and Processes
Journal of Logic and Computation, 1994
Property Preserving Abstractions for the Verification of Concurrent Systems
Formal Methods in System Design, 1995
Qualitative Logics and Equivalences for Probabilistic Systems
Logical Methods in Computer Science, 2009
Formalizing process algebraic verifications in the calculus of constructions
Formal Aspects of Computing, 1997
A Process-Theoretic Look at Automata
Lecture Notes in Computer Science, 2010
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM, 1993
Bisimilar and Logically Equivalent Programs in PDL
Electronic Notes in Theoretical Computer Science, 2014
Universal axioms for bisimulations
Theoretical Computer Science, 1993
On the Unification of Process Semantics: Equational Semantics
Electronic Notes in Theoretical Computer Science, 2009
Assume-Guarantee Verification of Concurrent Systems
2009
Universal Coinductive Characterisations of Process Semantics
IFIP International Federation for Information Processing, 2008
The use of static constructs in a model process logic
Lecture Notes in Computer Science, 1989
Behavioural and abstractor specifications revisited
Theoretical Computer Science, 2018