Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Online minimization of transition systems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of verification
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Towards scalable compositional analysis
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
A concurrency analysis tool suite for Ada programs: rationale, design, and preliminary experience
ACM Transactions on Software Engineering and Methodology (TOSEM)
Distinguishing tests for nondeterministic and probabilistic machines
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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
An Efficient Algorithm for Minimizing Real-Time Transition Systems
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
IEEE Transactions on Software Engineering
Parallel Algorithms for Relational Coarsest Partition Problems
IEEE Transactions on Parallel and Distributed Systems
Compositional verification of concurrent systems using Petri-net-based condensation rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
A formal approach to component based development of synchronous programs
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Forced simulation: A technique for automating component reuse in embedded systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Incremental Integration Testing of Concurrent Programs
IEEE Transactions on Software Engineering
Operational and abstract semantics of the query language G-Log
Theoretical Computer Science
Behaviour Analysis of Distributed Systems Using the Tracta Approach
Automated Software Engineering
Reduction of Timed Hybrid Systems
Discrete Event Dynamic Systems
Bisimulation Minimization and Symbolic Model Checking
Formal Methods in System Design
Knowledge-Based Software Architectures: Acquisition, Specification, and Verification
IEEE Transactions on Knowledge and Data Engineering
Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming
Proceedings of the 17th International Conference on Logic Programming
State Space Reduction Using Partial tau-Confluence
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Deriving Symbolic Representations from Stochastic Process Algebras
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
Classification of Security Properties (Part I: Information Flow)
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Modular State Level Analysis of Distributed Systems Techniques and Tool Support
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Checking for CFFD-Preorder with Tester Processes
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Symbolic Model Checking for Rectangular Hybrid Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
A Classification of Symbolic Transition Systems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Hereditary History Preserving Bisimilarity Is Undecidable
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Parametric Analysis of the State Explosion Problem in Model Checking
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Proofs Methods for Bisimulation Based Information Flow Security
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Designing the Minimal Structure of Hidden Markov Model by Bisimulation
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
``Next'' Heuristic for On-the-Fly Model Checking
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Techniques for Decidability and Undecidability of Bisimilarity
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Weak Bisimulation for Probabilistic Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Symbolic Algorithms for Infinite-State Games
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Alphabet-Based Synchronisation is Exponentially Cheaper
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Decision Algorithms for Probabilistic Bisimulation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
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
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
P-Hardness of Equivalence Testing on Finite-State Processes
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Axiomatizing the Least Fixed Point Operation and Binary Supremum
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Compositional Performance Modelling with TIPPtool
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Model-Checking Based Data Retrieval
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Modeling and verification of parallel processes
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
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
Information Flow Security in Dynamic Contexts
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Undecidability of domino games and hhp-bisimilarity
Information and Computation
From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
Security check: a formal yet practical framework for secure software architecture
Proceedings of the 2003 workshop on New security paradigms
Ackermann encoding, bisimulations and OBDDs
Theory and Practice of Logic Programming
Nested semantics over finite trees are equationally hard
Information and Computation
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
A Synchronous Process Calculus for Service Costs
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
SYNERGY: a new algorithm for property checking
Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering
Coalgebraic minimization of HD-automata for the π-calculus using polymorphic types
Theoretical Computer Science - Formal methods for components and objects
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Information flow security in dynamic contexts
Journal of Computer Security
Backward Bisimulation in Markov Chain Model Checking
IEEE Transactions on Software Engineering
A Graphical Language for Specifying and Analyzing Real-Time Systems
Integrated Computer-Aided Engineering
Priority and abstraction in process algebra
Information and Computation
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Parameter Synthesis for Piecewise Affine Systems from Temporal Logic Specifications
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Contract-Directed Synthesis of Simple Orchestrators
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Applying model-checking to solve queries on semistructured data
Computer Languages, Systems and Structures
Approximated Reachability on Hybrid Automata: Falsification meets Certification
Electronic Notes in Theoretical Computer Science (ENTCS)
(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)
Minimization Algorithm for Symbolic Bisimilarity
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
A Uniform Approach to Three-Valued Semantics for μ-Calculus on Abstractions of Hybrid Automata
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Undecidable equivalences for basic parallel processes
Information and Computation
On determinism in modal transition systems
Theoretical Computer Science
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
On the computational complexity of bisimulation, redux
Information and Computation
On the expressive power of recursion, replication and iteration in process calculi
Mathematical Structures in Computer Science
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
State class constructions for branching analysis of time Petri nets
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
An incremental bisimulation algorithm
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
CCS with replication in the Chomsky hierarchy: the expressive power of divergence
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Depletable channels: dynamics and behaviour
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Coalgebraic symbolic semantics
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Contract-based discovery of Web services modulo simple orchestrators
Theoretical Computer Science
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Model refinement using bisimulation quotients
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
A time-based formalism for the validation of semantic composability
Winter Simulation Conference
Computing the maximum bisimulation with spiking neural P systems
Computation, cooperation, and life
Isomorphism of regular trees and words
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Database foundations for scalable RDF processing
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
A succinct canonical register automaton model
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
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
On-the-Fly branching bisimulation minimization for compositional analysis
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
A coalgebraic perspective on linear weighted automata
Information and Computation
Protocol system integration, interface and interoperability
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Timing-sensitive information flow analysis for synchronous systems
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Sigref: a symbolic bisimulation tool box
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Decidability results for choreography realization
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
Minimization of non-deterministic automata with large alphabets
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Weak markovian bisimulation congruences and exact CTMC-Level aggregations for sequential processes
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
EXPTIME-completeness of thorough refinement on modal transition systems
Information and Computation
Deadlock-freedom in component systems with architectural constraints
Formal Methods in System Design
Coalgebraic models for reactive systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A succinct canonical register automaton model for data domains with binary relations
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Isomorphism of regular trees and words
Information and Computation
Deciding bisimilarities on distributions
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
| Hi-index | 0.01 |