Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
The power of the future perfect in program logics
Information and Control
Extensional equivalence for transition systems
Acta Informatica
Observation equivalence as a testing equivalence
Theoretical Computer Science
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Communication and concurrency
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the Fourth Annual Symposium on Logic in computer science
Proceedings of the international workshop on Automatic verification methods for finite state systems
Using the axiomatic presentation of behavioural equivalences for manipulating CCS specifications
Proceedings of the international workshop on Automatic verification methods for finite state systems
Implementing a model checking algorithm by adapting existing automated tools
Proceedings of the international workshop on Automatic verification methods for finite state systems
An efficient algorithm for branching bisimulation and stuttering equivalence
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Process algebra
About semantic action refinement
Fundamenta Informaticae
Axiom system induced by CTL* Logic
Fundamenta Informaticae
Action versus state based logics for transition systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Applications of process algebra
Applications of process algebra
Handbook of logic in computer science (vol. 2)
An action-based framework for verifying logical and behavioural properties of concurrent systems
Computer Networks and ISDN Systems - Special issue on tools for FDTs
Translations between modal logics of reactive systems
AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
LOTOSphere: Software Development with Lotos
LOTOSphere: Software Development with Lotos
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Computing Distinguishing Formulas for Branching Bisimulation
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Proceedings of the Conference on Logic of Programs
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Model Checking Under Generalized Fairness Constraints
Model Checking Under Generalized Fairness Constraints
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Bisimulations for Temporal Logic
Journal of Logic, Language and Information
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Model Checking Modal Transition Systems Using Kripke Structures
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Towards Model Checking Stochastic Process Algebra
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Connectors Synthesis for Deadlock-Free Component-Based Architectures
Proceedings of the 16th IEEE international conference on Automated software engineering
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Fluent model checking for event-based systems
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Branching time and orthogonal bisimulation equivalence
Theoretical Computer Science
A domain equation for refinement of partial systems
Mathematical Structures in Computer Science
A theory of normed simulations
ACM Transactions on Computational Logic (TOCL)
Stuttering Abstraction for Model Checkin
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Towards an architectural approach for the dynamic and automatic composition of software components
Proceedings of the ISSTA 2006 workshop on Role of software architecture for testing and analysis
Branching bisimulation for probabilistic systems: characteristics and decidability
Theoretical Computer Science - Expressiveness in concurrency
A general approach to comparing infinite-state systems with their finite-state specifications
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
An intruder model for verifying liveness in security protocols
Proceedings of the fourth ACM workshop on Formal methods in security
Optimization techniques for BDD-based bisimulation computation
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Operational semantics for Petri net components
Theoretical Computer Science
Universal extensions to simulate specifications
Information and Computation
Generalizing the Paige--Tarjan algorithm by abstract interpretation
Information and Computation
Formal verification of an automotive scenario in service-oriented computing
Proceedings of the 30th international conference on Software engineering
Specifying and Analysing SOC Applications with COWS
Concurrency, Graphs and Models
Property Preservation along Embedding of Biological Regulatory Networks
AB '08 Proceedings of the 3rd international conference on Algebraic Biology
Journal of Systems and Software
State Space Reduction Techniques for Component Interfaces
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
Representing and Validating Digital Business Processes
Advances in Web Semantics I
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Specification and Analysis of SOC Systems Using COWS: A Finance Case Study
Electronic Notes in Theoretical Computer Science (ENTCS)
CMC-UMC: a framework for the verification of abstract service-oriented properties
Proceedings of the 2009 ACM symposium on Applied Computing
A Symbolic Semantics for a Calculus for Service-Oriented Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae
Computing Stuttering Simulations
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Process Algebra: An Algebraic Theory of Concurrency
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
An efficient simulation algorithm based on abstract interpretation
Information and Computation
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 model checking approach for verifying COWS specifications
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
Characterizing locality (encapsulation) with bisimulation
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
A state/event-based model-checking approach for the analysis of abstract system properties
Science of Computer Programming
An accessible verification environment for UML models of services
Journal of Symbolic Computation
A logical framework to deal with variability
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Folk theorems on the correspondence between state-based and event-based systems
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Simulation refinement for concurrency verification
Science of Computer Programming
Dynamic consistency in process algebra: From Paradigm to ACP
Science of Computer Programming
Stuttering mostly speeds up solving parity games
NFM'11 Proceedings of the Third international conference on NASA Formal methods
A model-checking tool for families of services
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
Game-theoretic simulation checking tool
Programming and Computing Software
The SENSORIA reference modelling language
Rigorous software engineering for service-oriented systems
An abstract, on the fly framework for the verification of service-oriented systems
Rigorous software engineering for service-oriented systems
Branching bisimulation congruence for probabilistic systems
Theoretical Computer Science
A dynamic assertion-based verification platform for validation of UML designs
ACM SIGSOFT Software Engineering Notes
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
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
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
A formal model for service-oriented interactions
Science of Computer Programming
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
Information and Computation
State space reduction of rewrite theories using invisible transitions
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Smaller abstractions for ∀CTL* without next
Concurrency, Compositionality, and Correctness
State/Event software verification for branching-time specifications
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
A logical verification methodology for service-oriented computing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Decompositional reasoning about the history of parallel processes
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Encapsulating deontic and branching time specifications
Theoretical Computer Science
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae
Reusable and correct endogenous model transformations
ICMT'12 Proceedings of the 5th international conference on Theory and Practice of Model Transformations
All linear-time congruences for familiar operators part 2: infinite LTSs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Revisiting weak simulation for substochastic markov chains
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Simulation for lattice-valued doubly labeled transition systems
International Journal of Approximate Reasoning
| Hi-index | 0.01 |
Three temporal logics are introduced that induce on labeled transition systems the same identifications as branching bisimulation, a behavioral equivalence that aims at ignoring invisible transitions while preserving the branching structure of systems. The first logic is an extension of Hennessy-Milner Logic with an “until” operator. The second one is another extension of Hennessy-Milner Logic, which exploits the power of backward modalities. The third logic is CTL* without the next-time operator. A relevant side-effect of the last characterization is that it sets a bridge between the state- and action-based approaches to the semantics of concurrent systems.