Communicating sequential processes
Communicating sequential processes
“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)
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Decidability of bisimulation equivalence for processes generating context-free languages
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Tableau-based model checking in the propositional mu-calculus
Acta Informatica
Process algebra
Recursive process definitions with the state operator
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Verifying temporal properties of systems
Verifying temporal properties of systems
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Local model checking for infinite state spaces
Selected papers of the Second Workshop on Concurrency and compositionality
A short proof of the decidability of bisimulation for normed BPA-processes
Information Processing Letters
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Handbook of logic in computer science (vol. 2)
Deciding bisimilarity of normed context-free processes is in &Sgr; p2
Theoretical Computer Science
Undecidable equivalences for basic process algebra
Information and Computation
Modal and temporal logics for processes
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
An axiomatic basis for computer programming
Communications of the ACM
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
The Definability of Equational Graphs in Monadic Second-Order Logic
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
A Note on Model Checking the Modal nu-Calculus
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Computing Behavioural Relations, Logically
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Local Model Checking for Context-Free Processes
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
A Hierarchy Theorem for the µ-Calculus
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
The Equivalence Problem for Deterministic Pushdown Automata is Decidable
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Local Model Checking in the Modal Mu-Calculus
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Bisimulation Equivalence is Decidable for all Context-Free Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Model Checking for Context-Free Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Bisimulation for Models in Concurrency
CONCUR '94 Proceedings of the Concurrency Theory
A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes
CONCUR '94 Proceedings of the Concurrency Theory
Verification of Nonregular Temporal Properties for Context-Free Processes
CONCUR '94 Proceedings of the Concurrency Theory
Regularity of BPA-Systems is Decidable
CONCUR '94 Proceedings of the Concurrency Theory
Pushdown Processes: Parallel Composition and Model Checking
CONCUR '94 Proceedings of the Concurrency Theory
Decidability of Bisimulation Equivalence for Normed Pushdown Processes
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
The Modal mu-calculus Alternation Hierarchy is Strict
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Bisimulation Collapse and the Process Taxonomy
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
On the transition graphs of automata and grammars
WG '90 Proceedings of the 16rd International Workshop on Graph-Theoretic Concepts in Computer Science
A Fast Algorithm to Decide on Simple Grammars Equivalence
Proceedings of the International Symposium on Optimal Algorithms
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Faster Model Checking for the Modal Mu-Calculus
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes
Proceedings of the 7th International Conference on Computer Aided Verification
Process theory based on bisimulation semantics
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Verification and Specifications of Concurrent Programs
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Verification Tools for Finite-State Concurrent Systems
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Proof System for Hennessy-Milner Logic with Recursion
CAAP '88 Proceedings of the 13th Colloquium on Trees in Algebra and Programming
On the Decidability of Model Checking for Several µ-calculi and Petri Nets
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
A polynomial-time algorithm for deciding equivalence of normed context-free processes
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Simple deterministic languages
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
Model Checking Linear Properties of Prefix-Recognizable Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Automata logics, and infinite games
| Hi-index | 0.00 |