Concurrent Processes and Their Syntax
Journal of the ACM (JACM)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Denotational Description of Programming Languages: An Introduction
The Denotational Description of Programming Languages: An Introduction
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Journal of the ACM (JACM)
Language support for the specification and development of composite systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus of higher order communicating systems
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulation through probabilistic testing (preliminary report)
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of the ACM (JACM)
Formalization of Protocol Engineering Concepts
IEEE Transactions on Computers - Special issue on protocol engineering
Towards a type theory for active objects
OOPSLA/ECOOP '90 Proceedings of the workshop on Object-based concurrent programming
Termination, deadlock, and divergence
Journal of the ACM (JACM)
A Rely and Guarantee Method for Timed CSP: A Specification and Design of a Telephone Exchange
IEEE Transactions on Software Engineering
IDL '94 Proceedings of the workshop on Interface definition languages
The complexity of verification
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A compositional verification method for LOTOS
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Three logics for branching bisimulation
Journal of the ACM (JACM)
Observer-A Concept for Formal On-Line Validation of Distributed Systems
IEEE Transactions on Software Engineering
Compiler correctness for parallel languages
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
A Formal Verification Environment for Railway Signaling System Design
Formal Methods in System Design - Special issue: industrial critical systems
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extensionality and intensionality of the ambient logics
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A really abstract concurrent model and its temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Persistence and minimality in epistemic logic
Annals of Mathematics and Artificial Intelligence
Planning Proofs of Equations in CCS
Automated Software Engineering
Toupie: The µ-calculus over Finite Domains as a Constraint Language
Journal of Automated Reasoning
Checking Simple Properties of Transition Systems Defined by Thue Specifications
Journal of Automated Reasoning
Bisimulations for Temporal Logic
Journal of Logic, Language and Information
Modal Logic over Finite Structures
Journal of Logic, Language and Information
Bisimulation Minimization and Symbolic Model Checking
Formal Methods in System Design
Nordic Journal of Computing
A mechanized theory of the &pi-calculus in Hol
Nordic Journal of Computing
Games and logics for a noninterleaving bisimulation
Nordic Journal of Computing
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
Synthesizing distinguishing formulae for real time systems
Nordic Journal of Computing
Parallel Refinement Mechanisms for Real-Time Systems
FASE '00 Proceedings of the Third Internationsl Conference on Fundamental Approaches to Software Engineering: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
A Broadcast-based Calculus for Communicating Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Characterizing Timed Net Processes Categorically
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Symmetry Reduction Criteria for Software Model Checking
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Modular Specification of Concurrent Systems with Observational Logic
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Bisimulation Equivalences for Graph Grammars
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Bisimulation Lattice of Chi Processes
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Pi-Congruences as CCS Equivalences
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Congruent Weak Conformance, a Partial Order among Processes
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Testing Labelled Markov Processes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A General Approach to Multi-agent Minimal Knowledge
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
A Modal Logic for Network Topologies
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Mobile Processes: A Commented Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Branching vs. Linear Time: Final Showdown
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Hereditary History Preserving Bisimilarity Is Undecidable
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An Abstract Schema for Equivalence-Checking Games
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Lifting Temporal Proofs through Abstractions
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Generalized Model Checking: Reasoning about Partial State Spaces
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Abstraction-Based Model Checking Using Modal Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
On the Power of Labels in Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A Hierarchy of Polynomial-Time Computable Simulations for Automata
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A Spatial Logic for Concurrency (Part II)
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
From Asymmetry to Full Symmetry: New Techniques for Symmetry Reduction in Model Checking
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Bisimulation and Model Checking
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Probabilistic Temporal Logics via the Modal Mu-Calculus
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Testing Hennessy-Milner Logic with Recursion
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Compositional Verification of CCS Processes
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Observational Semantics for Timed Event Structures
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Graded Modalities and Resource Bisimulation
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
A Semantic Theory for Heterogeneous System Design
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Formalizing Properties of Mobile Agent Systems
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Model-Checking: A Tutorial Introduction
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
A Symbolic Model Checker for ACTL
FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
An Adequate Logic for Full LOTOS
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Model Checking Partial State Spaces with 3-Valued Temporal Logics
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Compositional Modeling and Verification of Workflow Processes
Business Process Management, Models, Techniques, and Empirical Studies
A Logical Viewpoint on Process-Algebraic Quotients
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Synchronized Product of Linear Bounded Machines
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On the Category of Event Structures with Dense Time
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Towards Model Checking Stochastic Process Algebra
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Specifying Performance Measures for PEPA
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
An Approximation Semantics for the Propositional Mu-Calculus
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Exploiting Modal Logic to Express Performance Measures
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Mobile processes: a commented bibliography
Modeling and verification of parallel processes
Bisimulation equivalences for graph grammars
Formal and natural computing
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
Storeless semantics and alias logic
Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Bisimulation analysis of SDL-expressed protocols: a case study
CASCON '00 Proceedings of the 2000 conference of the Centre for Advanced Studies on Collaborative research
Proving testing preorders for process algebra descriptions
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Equivalence notions and model minimization in Markov decision processes
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Bisimulation congruence of ℵ-calculus
Information and Computation
Undecidability of domino games and hhp-bisimilarity
Information and Computation
Bisimulation and language equivalence
Logic for concurrency and synchronisation
Equational reasoning about LOTOS specifications: a rewriting approach
IWSSD '91 Proceedings of the 6th international workshop on Software specification and design
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
A modal logic for mobile agents
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science
Branching time and orthogonal bisimulation equivalence
Theoretical Computer Science
Mathematical Structures in Computer Science
On the bisimulation proof method
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Mathematical modal logic: a view of its evolution
Journal of Applied Logic
Review of "The logic of typed feature structures" by Bob Carpenter. Cambridge University Press 1992.
Computational Linguistics
A model-checking verification environment for mobile processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
Formulae Meet Programs Over the Net: A Framework for Correct Network Aware Programming
Automated Software Engineering
Theoretical Computer Science - Logic, semantics and theory of programming
A compositional logic for polymorphic higher-order functions
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
A domain equation for refinement of partial systems
Mathematical Structures in Computer Science
From process logic to program logic
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Nested semantics over finite trees are equationally hard
Information and Computation
Applicability of fair simulation
Information and Computation
A spatial logic for concurrency--II
Theoretical Computer Science - Special issue: Foundations of wide area network computing
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
A comonadic account of behavioural covarieties of coalgebras
Mathematical Structures in Computer Science
Verifying mutual exclusion and liveness properties with split preconditions
Journal of Computer Science and Technology
CCS with Hennessy's merge has no finite-equational axiomatization
Theoretical Computer Science - Expressiveness in concurrency
Logical verification and equational verification
ACM SIGACT News
Generating diagnostic information for behavioral preorders
Distributed Computing
A logical analysis of aliasing in imperative higher-order functions
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
Small bisimulations for reasoning about higher-order imperative programs
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the universal and existential fragments of the μ-calculus
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Compositionality of Hennessy-Milner logic by structural operational semantics
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
A foundation for behavioural conformance in software product line architectures
Proceedings of the ISSTA 2006 workshop on Role of software architecture for testing and analysis
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
Probabilistic temporal logics via the modal mu-calculus
Theoretical Computer Science
Splitting bisimulations and retrospective conditions
Information and Computation
A modal proof theory for final polynomial coalgebras
Theoretical Computer Science
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
On compositionality and its limitations
ACM Transactions on Computational Logic (TOCL)
Two case studies of semantics execution in Maude: CCS and LOTOS
Formal Methods in System Design
A calculus of logical relations for over- and underapproximating static analyses
Science of Computer Programming
Verification and conformance test generation of communication protocol for railway signaling systems
Computer Standards & Interfaces
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Modal Logic Characterization of Markovian Testing and Trace Equivalences
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraic Modal Logic Beyond Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Extracting Program Logics From Abstract Interpretations Defined by Logical Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Model checking the Java metalocking algorithm
ACM Transactions on Software Engineering and Methodology (TOSEM)
Operational semantics for Petri net components
Theoretical Computer Science
Ultraproducts and possible worlds semantics in institutions
Theoretical Computer Science
Extensionality of Spatial Observations in Distributed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Functional verification of task partitioning for multiprocessor embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Priority and abstraction in process algebra
Information and Computation
A logical analysis of aliasing in imperative higher-order functions
Journal of Functional Programming
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
Electronic Notes in Theoretical Computer Science (ENTCS)
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
ACTLW - An action-based computation tree logic with unless operator
Information Sciences: an International Journal
Bisimulation relations for weighted automata
Theoretical Computer Science
On the axiomatisability of priority
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Multiple-labelled transition systems for nominal calculi and their logics†
Mathematical Structures in Computer Science
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal verification of an automotive scenario in service-oriented computing
Proceedings of the 30th international conference on Software engineering
Compositional verification of sequential programs with procedures
Information and Computation
The Temporal Logic of Rewriting: A Gentle Introduction
Concurrency, Graphs and Models
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
Concurrency, Graphs and Models
A Complete Axiomatic System for a Process-Based Spatial Logic
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Undecidability of Model Checking in Brane Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A finite equational base for CCS with left merge and communication merge
ACM Transactions on Computational Logic (TOCL)
TAPAs: A Tool for the Analysis of Process Algebras
Transactions on Petri Nets and Other Models of Concurrency I
Game Characterizations of Process Equivalences
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
A Cancellation Theorem for BCCSP
Fundamenta Informaticae
Theoretical Computer Science
(Bi)simulations up-to characterise process semantics
Information and Computation
Bialgebraic methods and modal logic in structural operational semantics
Information and Computation
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Logics and Bisimulation Games for Concurrency, Causality and Conflict
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Counting the Cost in the Picalculus (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Assume-Guarantee Verification of Concurrent Systems
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae
Transmission Protocols for Instruction Streams
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Algebra and logic for resource-based systems modelling
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Component Simulation-based Substitutivity Managing QoS Aspects
Electronic Notes in Theoretical Computer Science (ENTCS)
Teaching Concurrency: Theory in Practice
TFM '09 Proceedings of the 2nd International Conference on Teaching Formal Methods
A Rule Format for Unit Elements
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
From Bialgebraic Semantics to Congruence Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Truly Concurrent Logic via In-Between Specification
Electronic Notes in Theoretical Computer Science (ENTCS)
A Modal Logic for π-Calculus and Model Checking Algorithm
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical Specification and Analysis of Fault Tolerant Systems Through Partial Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Divide and Congruence Applied to η-Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
A domain equation for bisimulation
Information and Computation
On the computational complexity of bisimulation, redux
Information and Computation
Applicability of fair simulation
Information and Computation
Model Checking for a Class of Weighted Automata
Discrete Event Dynamic Systems
Theoretical Computer Science
Logical characterizations of bisimulations for discrete probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
ESOP'03 Proceedings of the 12th European conference on Programming
On the universal and existential fragments of the µ-calculus
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A survey of Markovian behavioral equivalences
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Logical semantics of types for concurrency
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Ready to preorder: get your BCCSP axiomatization for free!
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Observing distributed computation: a dynamic-epistemic approach
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Action abstraction in timed process algebra: the case for an untimed silent step
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Branching vs. linear time: semantical perspective
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Efficient and expressive tree filters
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Component simulation-based substitutivity managing QoS and composition issues
Science of Computer Programming
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
Structural Operational Semantics and Modal Logic, Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
On Rule Formats for Zero and Unit Elements
Electronic Notes in Theoretical Computer Science (ENTCS)
On bisimilarity and substitution in presence of replication
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Simulation and bisimulation for probabilistic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A theory of design-by-contract for distributed multiparty interactions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A state/event-based model-checking approach for the analysis of abstract system properties
Science of Computer Programming
Property-preserving refinement of concurrent systems
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Resource bisimilarity and graded bisimilarity coincide
Information Processing Letters
Probabilistic Logical Characterization
Information and Computation
The linear temporal logic of rewriting Maude model checker
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Characterising probabilistic processes logically
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Information Processing Letters
Model-checking games for fixpoint logics with partial order models
Information and Computation
Component-oriented verification of noninterference
Journal of Systems Architecture: the EUROMICRO Journal
Automatica (Journal of IFAC)
Linear-time and may-testing in a probabilistic reactive setting
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Axiomatizing weak ready simulation semantics over BCCSP
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Bisimulations meet PCTL equivalences for probabilistic automata
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
An abstract, on the fly framework for the verification of service-oriented systems
Rigorous software engineering for service-oriented systems
Cedalion: a language for language oriented programming
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Partial knowledge in membrane systems: a logical approach
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Two-thirds simulation indexes and modal logic characterization
Frontiers of Computer Science in China
Weak Alphabet Merging of Partial Behavior Models
ACM Transactions on Software Engineering and Methodology (TOSEM)
Divide and congruence: from decomposition of modalities to preservation of branching bisimulation
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
A finite model construction for coalgebraic modal logic
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Undecidability results for bisimilarity on prefix rewrite systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A finite equational base for CCS with left merge and communication merge
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
A logical characterization of efficiency preorders
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
MoMo: a modal logic for reasoning about mobility
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Modal logics for brane calculus
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
Decidable extensions of hennessy-milner logic
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
On the expressiveness of refinement settings
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
A coordination model for interactive components
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
An abstract interpretation-based refinement algorithm for strong preservation
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Scenario synthesis from imprecise requirements
SAM'04 Proceedings of the 4th international SDL and MSC conference on System Analysis and Modeling
An Algebra of Behavioural Types
Information and Computation
Timed equivalences for timed event structures
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Expressivity of coalgebraic modal logic: the limits and beyond
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Strong splitting bisimulation equivalence
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
The least fibred lifting and the expressivity of coalgebraic modal logic
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Final semantics for event-pattern reactive programs
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Covarieties of coalgebras: comonads and coequations
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Deriving non-determinism from conjunction and disjunction
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Logics for contravariant simulations
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
A characterisation of weak bisimulation congruence
Processes, Terms and Cycles
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
Finite equational bases in process algebra: results and open questions
Processes, Terms and Cycles
Model theory for process algebra
Processes, Terms and Cycles
Information and Computation
An integrated framework for scenarios and state machines
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Bisimulations for untyped imperative objects
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Value-passing CCS with noisy channels
Theoretical Computer Science
Behavioral interface specification languages
ACM Computing Surveys (CSUR)
The equational theory of weak complete simulation semantics over BCCSP
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A logical verification methodology for service-oriented computing
ACM Transactions on Software Engineering and Methodology (TOSEM)
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
A unified theory of program logics: an approach based on the π-calculus
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Towards a symbolic modal logic for LOTOS
1FACS'96 Proceedings of the 1st BCS-FACS conference on Northern Formal Methods
Approximating Markov processes through filtration
Theoretical Computer Science
First-order reasoning for higher-order concurrency
Computer Languages, Systems and Structures
Bisimulation Metrics for Continuous Markov Decision Processes
SIAM Journal on Computing
Combining epistemic logic and hennessy-milner logic
Logic and Program Semantics
Decidability of modular logics for concurrency
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Guaranteeing Weak Termination in Service Discovery
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Epistemic Strategies and Games on Concurrent Processes
ACM Transactions on Computational Logic (TOCL)
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae
A Cancellation Theorem for BCCSP
Fundamenta Informaticae
Context aware specification and verification of distributed systems
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Analysis of Timed Concurrent Models Based on Testing Equivalence
Fundamenta Informaticae
Improving Partial Order Reductions for Universal Branching Time Properties
Fundamenta Informaticae
The AltaRica Formalism for Describing Concurrent Systems
Fundamenta Informaticae
Parameterized Structured Operational Semantics
Fundamenta Informaticae
Truth of Duration Calculus Formulae in Timed Frames
Fundamenta Informaticae
Atomicity And Concurrency Control In Process Calculi
Fundamenta Informaticae
A pseudometric in supervisory control of probabilistic discrete event systems
Discrete Event Dynamic Systems
The saga of the axiomatization of parallel composition
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Compositionality of probabilistic Hennessy-Milner logic through structural operational semantics
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Open bisimulation for quantum processes
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Checking bisimilarity for attributed graph transformation
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Interpreted systems semantics for process algebra with identity annotations
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Testing probabilistic equivalence through Reinforcement Learning
Information and Computation
Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Approximating Markov Processes by Averaging
Journal of the ACM (JACM)
Theories of Programming and Formal Methods
Coinductive Predicates and Final Sequences in a Fibration
Electronic Notes in Theoretical Computer Science (ENTCS)
An observationally complete program logic for imperative higher-order functions
Theoretical Computer Science
Simulation for lattice-valued doubly labeled transition systems
International Journal of Approximate Reasoning
On the Behaviours Produced by Instruction Sequences under Execution
Fundamenta Informaticae
Hi-index | 0.03 |
Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input/output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth. First, a definition is given of what it is for two programs or program parts to be equivalent for all observers; then two program parts are said to be observation congruent if they are, in all program contexts, equivalent. The behavior of a program part, that is, its meaning, is defined to be its observation congruence class.The paper demonstrates, for a sequence of simple languages expressing finite (terminating) behaviors, that in each case observation congruence can be axiomatized algebraically. Moreover, with the addition of recursion and another simple extension, the algebraic language described here becomes a calculus for writing and specifying concurrent programs and for proving their properties.