On &ohgr;-automata and temporal logic
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A calculus of higher order communicating systems
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Temporal logic programming is complete and expressive
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
Formal Analysis of the Alternating Bit Protocol by Temporal Petri Nets
IEEE Transactions on Software Engineering
On the soundness of graphical representations of interconnected processes in LOTOS
Conference proceedings on Formal methods in software development
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modeling concurrency with geometry
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The algebraic specification language LOTOS: an industrial experience
Conference proceedings on Formal methods in software development
A model-theoretic analysis of knowledge
Journal of the ACM (JACM)
A toolbox for the verification of LOTOS programs
ICSE '92 Proceedings of the 14th international conference on Software engineering
ACM Transactions on Programming Languages and Systems (TOPLAS)
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Verifying infinite state processes with sequential and parallel composition
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Three logics for branching bisimulation
Journal of the ACM (JACM)
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
Engineering change in a non-deterministic FSM setting
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Partial-evaluation techniques for concurrent programs
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Denotational semantics using an operationally-based term model
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relational transducers for electronic commerce
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
A Formal Verification Environment for Railway Signaling System Design
Formal Methods in System Design - Special issue: industrial critical systems
Trace-Based Abstract Interpretation of Operational Semantics
Lisp and Symbolic Computation
Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
Recursive subtyping revealed: (functional pearl)
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Formal Methods in System Design
Object-oriented nets with algebraic specifications: the CO-OPN/2 formalism
Concurrent object-oriented programming and petri nets
Enhanced operational semantics: a tool for describing and analyzing concurrent systems
ACM Computing Surveys (CSUR)
Basic process algebra with deadlocking states
Theoretical Computer Science
Recursive equations in higher-order process calculi
Theoretical Computer Science
Register-machine based processes
Journal of the ACM (JACM)
Efficient and flexible matching of recursive types
Information and Computation
Covering indexes for branching path queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Theoretical Computer Science
Process algebra and Markov chains
Lectures on formal methods and performance analysis
Additive models of probabilistic processes
Theoretical Computer Science
Operational and abstract semantics of the query language G-Log
Theoretical Computer Science
Noninterference for concurrent programs and thread systems
Theoretical Computer Science
Planning Proofs of Equations in CCS
Automated Software Engineering
Ambiguous Discourse in a Compositional Context. An Operational Perspective
Journal of Logic, Language and Information
Ordered SOS process languages for branching and Eager bisimulation
Information and Computation
A New Structural Induction Theorem for Rings of Temporal Petri Nets
IEEE Transactions on Software Engineering
Hierarchical Structuring of Superposed GSPNs
IEEE Transactions on Software Engineering
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Theoretical Computer Science - Rewriting logic and its applications
ACM Transactions on Computational Logic (TOCL)
A bisimulation method for cryptographic protocols
Nordic Journal of Computing
Comparing refinements for failure and bisimulation semantics
Fundamenta Informaticae
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
Why so Many Temporal Logics Climb up the Trees?
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Expressiveness of Updatable Timed Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Quantifying the Dynamic Behavior of Process Algebras
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Possibilistic and Probabilistic Abstraction-Based Model Checking
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Abstraction in Software Model Checking: Principles and Practice (Tutorial Overview and Bibliography)
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Refusal Simulation and Interactive Games
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Pi-Congruences as CCS Equivalences
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
A Timed Calculus for Distributed Objects with Clocks
ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
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
Efficient Verification Algorithms for One-Counter Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Topo-distance: Measuring the Difference between Spatial Patterns
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
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
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
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
Undecidability of Weak Bisimilarity for Pushdown Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
HOPLA-A Higher-Order Process Language
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Compositional Verification of Randomized Distributed Algorithms
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
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
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
Norm Functions for Probabilistic Bisimulations with Delays
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
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
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Analysis of Slope-Parametric Rectangular Automata
Hybrid Systems V
Process-Algebraic Foundations of Aspect-Oriented Programming
REFLECTION '01 Proceedings of the Third International Conference on Metalevel Architectures and Separation of Crosscutting Concerns
Weak Bisimilarity and Open Maps
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Equivalence-Checking with Infinite-State Systems: Techniques and Results
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Open Ended Systems, Dynamic Bisimulation and Tile Logic
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
A Semantics for Persistency in Propositional Dynamic Logic
CL '00 Proceedings of the First International Conference on Computational Logic
Error Detection with Directed Symbolic Model Checking
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Model Checking Partial State Spaces with 3-Valued Temporal Logics
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
The Equational Theory of Fixed Points with Applications to Generalized Language Theory
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
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
Axiomatizing the Least Fixed Point Operation and Binary Supremum
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Computing Spatial Similarity by Games
AI*IA 01 Proceedings of the 7th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
On Simulation-Checking with Sequential Systems
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay
Theoretical Computer Science - Category theory and computer science
The max-plus algebra of the natural numbers has no finite equational basis
Theoretical Computer Science
Modeling and verification of parallel processes
Integrating timed condition/event systems and timed automata for the verification of hybrid systems
Engineering of distributed control systems
On the computational complexity of bisimulation, redux
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Handbook of automated reasoning
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Efficient and Flexible Matching of Recursive Types
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Four combinators for concurrency
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A Petri net-based model for web service composition
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Stochastic Petri net semantics for stochastic process algebras
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Hierarchical Structuring of Superposed GSPNs
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
The Early Search for Tractable Ways of Reasoning about Programs
IEEE Annals of the History of Computing
A note on an expressiveness hierarchy for multi-exit iteration
Information Processing Letters
Structure-preserving binary relations for program abstraction
The essence of computation
A gap property of deterministic tree languages
Theoretical Computer Science - Logic and complexity in computer science
Equivalence notions and model minimization in Markov decision processes
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
A semantic theory for value-passing processes based on the late approach
Information and Computation
Weak bisimulation for (max/+) automata and related models
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
The complexity of bisimilarity-checking for one-counter processes
Theoretical Computer Science
Undecidability of domino games and hhp-bisimilarity
Information and Computation
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Branching time and orthogonal bisimulation equivalence
Theoretical Computer Science
Transition and cancellation in concurrency and branching time
Mathematical Structures in Computer Science
Complexity of weak bisimilarity and regularity for BPA and BPP
Mathematical Structures in Computer Science
Embedding untimed into timed process algebra: the case for explicit termination
Mathematical Structures in Computer Science
Observational trees as models for concurrency
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Specifying temporal data models for semistructured data by a constraint-based approach
Proceedings of the 2004 ACM symposium on Applied computing
Journal of Functional Programming
DP Lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation
De Bakker-Zucker processes revisited
Information and Computation
Mathematical modal logic: a view of its evolution
Journal of Applied Logic
Mining Frequent Labeled and Partially Labeled Graph Patterns
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
A model-checking verification environment for mobile processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
Incremental maintenance of XML structural indexes
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Static Analysis for State-Space Reductions Preserving Temporal Logics
Formal Methods in System Design
Theoretical Computer Science - Logic, semantics and theory of programming
A domain equation for refinement of partial systems
Mathematical Structures in Computer Science
Bisimulation on speed: worst-case efficiency
Information and Computation
Nested semantics over finite trees are equationally hard
Information and Computation
Towards a theory of bisimulation for the higher-order process calculi
Journal of Computer Science and Technology
Modelling and verifying web service orchestration by means of the concurrency workbench
ACM SIGSOFT Software Engineering Notes
Metrics for finite Markov decision processes
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
From sequential programs to multi-tier applications by program transformation
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
A coinductive calculus of streams
Mathematical Structures in Computer Science
A comonadic account of behavioural covarieties of coalgebras
Mathematical Structures in Computer Science
On bisimulations for the spi calculus
Mathematical Structures in Computer Science
Profunctors, open maps and bisimulation
Mathematical Structures in Computer Science
CCS with Hennessy's merge has no finite-equational axiomatization
Theoretical Computer Science - Expressiveness in concurrency
A brief history of process algebra
Theoretical Computer Science - Process algebra
Decomposition orders: another generalisation of the fundamental theorem of arithmetic
Theoretical Computer Science - Process algebra
Observational congruences for dynamically reconfigurable tile systems
Theoretical Computer Science - Process algebra
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
Comparative branching-time semantics for Markov chains
Information and Computation
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
Bisimulations up-to for the linear time branching time spectrum
CONCUR 2005 - Concurrency Theory
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
ACM Transactions on Embedded Computing Systems (TECS)
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
A tutorial on coinductive stream calculus and signal flow graphs
Theoretical Computer Science - Formal methods for components and objects
A modular approach to defining and characterising notions of simulation
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Towards integrated verification of timed transition models
Fundamenta Informaticae - Special issue on application of concurrency to system design (ACSD'04)
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Combining symmetry reduction and under-approximation for symbolic model checking
Formal Methods in System Design
A calculus of logical relations for over- and underapproximating static analyses
Science of Computer Programming
Information and Computation
Science of Computer Programming
Bisimilarity is not finitely based over BPA with interrupt
Theoretical Computer Science - Algebra and coalgebra in computer science
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Impossibility Results in the Equational Logic of Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Remarks on Testing Probabilistic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Observational Equivalences for Timed Stable Event Structures
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
A regular viewpoint on processes and algebra
Acta Cybernetica
Answering XML queries by means of data summaries
ACM Transactions on Information Systems (TOIS)
ACM Turing award lectures
Relating Hybrid Chi to Other Formalisms
Electronic Notes in Theoretical Computer Science (ENTCS)
Simulations Up-to and Canonical Preorders
Electronic Notes in Theoretical Computer Science (ENTCS)
A Congruence Rule Format with Universal Quantification
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
Covering indexes for XML queries: bisimulation - simulation = negation
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Modular construction of complete coalgebraic logics
Theoretical Computer Science
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Universal extensions to simulate specifications
Information and Computation
Bisimulation relations for weighted automata
Theoretical Computer Science
An Exercise on Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A theory for comparing the expressive power of access control models
Journal of Computer Security
Process Algebra with Local Communication
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterize branching distance in terms of (η,α)-bisimilarity
Information and Computation
Model Checking Knowledge and Linear Time: PSPACE Cases
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
New Bisimulation Semantics for Distributed Systems
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Idempotent Transductions for Modal Logics
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Approximately Bisimilar Symbolic Models for Incrementally Stable Switched Systems
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
25 Years of Model Checking
The Beginning of Model Checking: A Personal Perspective
25 Years of Model Checking
CoVaC: Compiler Validation by Program Analysis of the Cross-Product
FM '08 Proceedings of the 15th international symposium on Formal Methods
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Ugo Montanari and Software Verification
Concurrency, Graphs and Models
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
Concurrency, Graphs and Models
Checking Dependent Types Using Compiled Code
Implementation and Application of Functional Languages
Correcting a Space-Efficient Simulation Algorithm
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Calculating Invariants as Coreflexive Bisimulations
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Five Determinisation Algorithms
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Improved On-the-Fly Equivalence Checking Using Boolean Equation Systems
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Approximately bisimilar symbolic models for nonlinear control systems
Automatica (Journal of IFAC)
An architectural approach to the correct and automatic assembly of evolving component-based systems
Journal of Systems and Software
A finite equational base for CCS with left merge and communication merge
ACM Transactions on Computational Logic (TOCL)
State Space Reduction Techniques for Component Interfaces
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
A Behavioural Pseudometric based on λ--Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
Branching Bisimulation Congruence for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Applying model-checking to solve queries on semistructured data
Computer Languages, Systems and Structures
A Representative Function Approach to Symmetry Exploitation for CSP Refinement Checking
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
A P Systems Flat Form Preserving Step-by-step Behaviour
Fundamenta Informaticae
Generating priority rewrite systems for OSOS process languages
Information and Computation
(Bi)simulations up-to characterise process semantics
Information and Computation
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrency, σ -Algebras, and Probabilistic Fairness
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
On Process Equivalence = Equation Solving in CCS
Journal of Automated Reasoning
Axiomatizing rational power series over natural numbers
Information and Computation
Undecidable equivalences for basic parallel processes
Information and Computation
EXPTIME-complete Decision Problems for Modal and Mixed Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
A bisimulation-based approach to the analysis of human-computer interaction
Proceedings of the 1st ACM SIGCHI symposium on Engineering interactive computing systems
Structural Operational Semantics with First-Order Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Metrics for finite Markov decision processes
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Weighted Bisimulation in Linear Algebraic Form
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A network of communicating logic programs and its semantics
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
Non-cycle-accurate sequential equivalence checking
Proceedings of the 46th Annual Design Automation Conference
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Information and Computation
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
Congruence of Bisimulation in a Non-Deterministic Call-By-Need Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Adaptive Verification using Forced Simulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Contextual Labelled Semantics for Higher-order Process Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
Comparative branching-time semantics for Markov chains
Information and Computation
On the computational complexity of bisimulation, redux
Information and Computation
A modular approach to defining and characterising notions of simulation
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Pure bigraphs: Structure and dynamics
Information and Computation
A syntactic commutativity format for SOS
Information Processing Letters
Model Checking for a Class of Weighted Automata
Discrete Event Dynamic Systems
Modal and mixed specifications: Key decision problems and their complexities
Mathematical Structures in Computer Science
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
Information and Computation
On the expressiveness of interaction
Theoretical Computer Science
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Bisimulation and the reduction of Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
On the axiomatizability of ready traces, ready simulation, and failure traces
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Bisimulation proof methods for mobile ambients
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximating a behavioural pseudometric without discount for probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
A generic on-the-fly solver for alternation-free boolean equation systems
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
SAM: an efficient algorithm for F&B-index construction
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
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
Model checking for action abstraction
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Depletable channels: dynamics and behaviour
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Non-termination in idempotent semirings
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Complexity of decision problems for mixed and modal specifications
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Non-strongly stable orders also define interesting simulation relations
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Action Prefixes: Reified Synchronization Paths in Minimal Component Interaction Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic partition refinement with automatic balancing of time and space
Performance Evaluation
Unifying behavioral equivalences of timed transition systems
Programming and Computing Software
Component simulation-based substitutivity managing QoS and composition issues
Science of Computer Programming
An automatic method for the dynamic construction of abstractions of states of a formal model
Cybernetics and Systems Analysis
Tree-functors, determinacy and bisimulations
Mathematical Structures in Computer Science
On Rule Formats for Zero and Unit Elements
Electronic Notes in Theoretical Computer Science (ENTCS)
Fairness, Resources, and Separation
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulations Generated from Corecursive Equations
Electronic Notes in Theoretical Computer Science (ENTCS)
Program verification through characteristic formulae
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Reusing hardware components with single-state processes
SBCCI'99 Proceedings of the XIIth conference on Integrated circuits and systems design
Simulation and bisimulation for probabilistic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Concurrency and composition in a stochastic world
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Model independent order relations for processes
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Information Processing Letters
Simulations of weighted tree automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Timed Modal Logics for Real-Time Systems
Journal of Logic, Language and Information
Simulation refinement for concurrency verification
Science of Computer Programming
Stuttering mostly speeds up solving parity games
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Constructing replaceable services using operating guidelines and maximal controllers
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
A time-based formalism for the validation of semantic composability
Winter Simulation Conference
The decidability of the reachability problem for CCS!
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
A unifying formal basis for the SENSORIA approach: a white paper
Rigorous software engineering for service-oriented systems
A fully symbolic bisimulation algorithm
RP'11 Proceedings of the 5th international conference on Reachability problems
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Structural Analysis of Boolean Equation Systems
ACM Transactions on Computational Logic (TOCL)
Verification techniques for distributed algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Two-thirds simulation indexes and modal logic characterization
Frontiers of Computer Science in China
Abstraction and refinement in model checking
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
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
Approximate reachability for dead code elimination in esterel
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A finite basis for failure semantics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Orthogonal extensions in structural operational semantics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A perspective on component refinement
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Managing evolution in software product lines: a model-checking perspective
Proceedings of the Sixth International Workshop on Variability Modeling of Software-Intensive Systems
On the expressiveness of refinement settings
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Refinement patterns for hierarchical UML state machines
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Bisimulation quantified logics: undecidability
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Congruence for structural congruences
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Bisimilarity is not finitely based over BPA with interrupt
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
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
On finite alphabets and infinite bases III: simulation
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Ranked predicate abstraction for branching time: complete, incremental, and precise
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Sigref: a symbolic bisimulation tool box
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Synchronous message passing: on the relation between bisimulation and refusal equivalence
Concurrency, Compositionality, and Correctness
Concurrency, Compositionality, and Correctness
Process algebra: a unifying approach
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Linking theories of concurrency
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Unifying decidability results on protection systems using simulations
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
Constructing mid-points for two-party asynchronous protocols
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
A symbolic approach to the design of nonlinear networked control systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
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
On using syntactic action refinement to derive compositionally a timed efficient implementation
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
Aggregation of transitions in marking graph generation based on maximality semantics for petri nets
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Evaluation technique in the spicalculus for cryptographic protocols
ISIICT'09 Proceedings of the Third international conference on Innovation and Information and Communication Technology
Relating modal refinements, covariant-contravariant simulations and partial bisimulations
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Intentional automata: a context-dependent model for component connectors
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Argos: an automaton-based synchronous language
Computer Languages
Bisimulation Metrics for Continuous Markov Decision Processes
SIAM Journal on Computing
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Algebraic synchronization trees and processes
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Guaranteeing Weak Termination in Service Discovery
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
A P Systems Flat Form Preserving Step-by-step Behaviour
Fundamenta Informaticae
Towards Integrated Verification of Timed Transition Models
Fundamenta Informaticae - APPLICATION OF CONCURRENCY TO SYSTEM DESIGN (ACSD'04)
Formal verification of compiler transformations on polychronous equations
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Observational Equivalences for Timed Stable Event Structures
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Comparing Refinements for Failure and Bisimulation Semantics
Fundamenta Informaticae
Partition refinement of Component Interaction Automata
Science of Computer Programming
Parameterized Structured Operational Semantics
Fundamenta Informaticae
Discrete Time Process Algebra: Absolute Time, Relative Time And Parametric Time
Fundamenta Informaticae
Atomicity And Concurrency Control In Process Calculi
Fundamenta Informaticae
An Axiomatization for Regular Processes in Timed Branching Bisimulation
Fundamenta Informaticae
A COMPLETE AXIOMATIZATION FOR PREFIX ITERATION IN BRANCHING BISIMULATION
Fundamenta Informaticae
PROCESSES WITH MULTIPLE ENTRIES AND EXITS MODULO ISOMORPHISM AND MODULO BISIMULATION
Fundamenta Informaticae
Electronic Notes in Theoretical Computer Science (ENTCS)
Final Semantics for Decorated Traces
Electronic Notes in Theoretical Computer Science (ENTCS)
Rule formats for distributivity
Theoretical Computer Science
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
A distributed maximal scheduler for strong fairness
DISC'07 Proceedings of the 21st international conference on Distributed Computing
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Deciding the bisimilarity relation between datalog goals
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Isotactics as a foundation for alignment and abstraction of behavioral models
BPM'12 Proceedings of the 10th international conference on Business Process Management
A framework for automatic generation of security controller
Software Testing, Verification & Reliability
Borrowed contexts for attributed graphs
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Modular bisimulation theory for computations and values
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
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
The duality of state and observation in probabilistic transition systems
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Information flow in systems with schedulers, Part II: Refinement
Theoretical Computer Science
Structural operational semantics for stochastic and weighted transition systems
Information and Computation
A game-theoretic approach to fault diagnosis and identification of hybrid systems
Theoretical Computer Science
Hoare-style reasoning with (algebraic) continuations
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Efficiency and precision trade-offs in graph summary algorithms
Proceedings of the 17th International Database Engineering & Applications Symposium
Required behavior of sequence diagrams: Semantics and conformance
ACM Transactions on Software Engineering and Methodology (TOSEM)
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Using model checking to analyze the system behavior of the LHC production grid
Future Generation Computer Systems
Theories of Programming and Formal Methods
A Coalgebraic Perspective on Logical Interpretations
Studia Logica
Specification and Verification of Concurrent Programs Through Refinements
Journal of Automated Reasoning
A Connection Between Concurrency and Language Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
An observationally complete program logic for imperative higher-order functions
Theoretical Computer Science
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
On Minimality and Equivalence of Petri Nets
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.02 |