Protocol testing: review of methods and relevance for software testing
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Structured operational semantics as a specification language
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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)
From rewrite rules to bisimulation congruences
Theoretical Computer Science
Information and Computation
Inheritance of workflows: an approach to tackling problems related to change
Theoretical Computer Science
Formal methods for distributed processing
Process algebra and Markov chains
Lectures on formal methods and performance analysis
Synthesizing distinguishing formulae for real time systems
Nordic Journal of Computing
Ready-Simulation Is Not Ready to Express a Modular Refinement Relation
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
Analysis Problems for Sequential Dynamical Systems and Communicating State Machines
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer 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
Consistency of Partial Process Specifications
AMAST '98 Proceedings of the 7th 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
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Testing Transition Systems: An Annotated Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Testing Concurrent Systems: A Formal Approach
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
CONCUR '00 Proceedings of the 11th 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
The State Explosion Problem from Trace to Bisimulation Equivalence
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
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
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
The Join Calculus: A Language for Distributed Mobile Programming
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Testing transition systems: an annotated bibliography
Modeling and verification of parallel processes
Localic sup-lattices and tropological systems
Theoretical Computer Science - Topology in computer science
Branching time and orthogonal bisimulation equivalence
Theoretical Computer Science
Mathematical Structures in Computer Science
Distributed Computing - Special issue: Verification of lazy caching
When are two workflows the same?
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
A brief history of process algebra
Theoretical Computer Science - Process algebra
Comparative branching-time semantics for Markov chains
Information and Computation
Information and Computation
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Relations among quantum processes: bisimilarity and congruence
Mathematical Structures in Computer Science
Experiments in the use of τ-simulations for the components-verification of real-time systems
Proceedings of the 2006 conference on Specification and verification of component-based systems
Information and Computation
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
From RosettaNet PIPs to BPEL processes: A three level approach for business protocols
Data & Knowledge Engineering
Optimization techniques for BDD-based bisimulation computation
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Conjunction on processes: Full abstraction via ready-tree semantics
Theoretical Computer Science
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Stochastic Petri Box Calculus with Discrete Time
Fundamenta Informaticae
Formalization of test experiments
Programming and Computing Software
Electronic Notes in Theoretical Computer Science (ENTCS)
Weak parametric failure equivalences and their congruence formats
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
More Relational Concurrent Refinement: Traces and Partial Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
General Refinement, Part One: Interfaces, Determinism and Special Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Process Algebra with Local Communication
Electronic Notes in Theoretical Computer Science (ENTCS)
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
A Hierarchy of Equivalences for Probabilistic Processes
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A Context-Free Process as a Pushdown Automaton
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Rule Format for Associativity
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Ready to preorder: The case of weak process semantics
Information Processing Letters
Teaching Concurrency Concepts to Freshmen
Transactions on Petri Nets and Other Models of Concurrency I
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Modelling Divergence in Relational Concurrent Refinement
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
(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)
Reachability is decidable for weakly extended process rewrite systems
Information and Computation
Calculi for Service-Oriented Computing
Formal Methods for Web Services
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae
Complete open-state testing of limitedly nondeterministic systems
Programming and Computing Software
A Robust Semantics Hides Fewer Errors
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Circular Coinduction with Special Contexts
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
From Bialgebraic Semantics to Congruence Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Action Refinement for Real-Time Concurrent Processes with Urgency
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Semantics and Analysis of Component Connectors in Reo
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)
Information and Computation
Comparative branching-time semantics for Markov chains
Information and Computation
Theoretical Computer Science
On the expressiveness of interaction
Theoretical Computer Science
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
What semantic equivalences are suitable for non-interference properties in computer security
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
Reusing hardware components with single-state processes
SBCCI'99 Proceedings of the XIIth conference on Integrated circuits and systems design
Interaction semantics with refusals, divergence, and destruction
Programming and Computing Software
Concurrency and composition in a stochastic world
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Showing full semantics preservation in model transformation: a comparison of techniques
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Model independent order relations for processes
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Dynamic consistency in process algebra: From Paradigm to ACP
Science of Computer Programming
Process compliance analysis based on behavioural profiles
Information Systems
Refinement of synchronizable places with multi-workflow nets: weak termination preserved
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Axiomatizing weak ready simulation semantics over BCCSP
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Algebraic approach to linking the semantics of web services
Innovations in Systems and Software Engineering
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
An organisation infrastructure for multi-agent systems based on agent coordination contexts
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
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
Testing probabilistic equivalence through reinforcement learning
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On finite alphabets and infinite bases II: completed and ready simulation
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Conjunction on processes: full–abstraction via ready–tree semantics
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Is timed branching bisimilarity an equivalence indeed?
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
A process-theoretic look at automata
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Agent interaction semantics by timed operating instructions
AC'04 Proceedings of the 2004 international conference on Agent Communication
Incremental verification of component-based timed systems
International Journal of Computer Applications in Technology
A test generation framework for quiescent real-time systems
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
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
Welcome to the jungle: a subjective guide to mobile process calculi
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Liveness, fairness and impossible futures
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Operational determinism and fast algorithms
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Sigref: a symbolic bisimulation tool box
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
A characterisation of weak bisimulation congruence
Processes, Terms and Cycles
Information and Computation
Constructing mid-points for two-party asynchronous protocols
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Towards a formal foundation of behavioral types for UML state-machines
ACM SIGSOFT Software Engineering Notes
Designing a multiway synchronization protocol
Computer Communications
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae
Stochastic Petri Box Calculus with Discrete Time
Fundamenta Informaticae
Reusable and correct endogenous model transformations
ICMT'12 Proceedings of the 5th international conference on Theory and Practice of Model Transformations
Formal verification of compiler transformations on polychronous equations
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
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
Full Abstractness of a Metric Semantics for Action Refinement
Fundamenta Informaticae
ON FOUR PARTIAL ORDERING SEMANTICS FOR A PROCESS CALCULUS
Fundamenta Informaticae
A categorical observation of timed testing equivalence
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Equivalence checking for infinite systems using parameterized Boolean equation systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Ready simulation for concurrency: it's logical!
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A comparison of succinctly represented finite-state systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Isotactics as a foundation for alignment and abstraction of behavioral models
BPM'12 Proceedings of the 10th international conference on Business Process Management
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
A simple game-theoretic approach to checkonly QVT Relations
Software and Systems Modeling (SoSyM)
Testing probabilistic equivalence through Reinforcement Learning
Information and Computation
Generalizing simulation to abstract domains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Information and Computation
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
Refinement of Synchronizable Places with Multi-workflow Nets
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
| Hi-index | 0.01 |