A formalism for real-time concurrent object-oriented computing
OOPSLA '92 conference proceedings on Object-oriented programming systems, languages, and applications
ACM Transactions on Computational Logic (TOCL)
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
Understanding the mismatch combinator in Chi calculus
Theoretical Computer Science
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Theoretical Computer Science
Mathematical Structures in Computer Science
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Discrete Event Dynamic Systems
Theoretical Computer Science
Information and Computation
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
A regular viewpoint on processes and algebra
Acta Cybernetica
Priority and abstraction in process algebra
Information and Computation
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A finite equational base for CCS with left merge and communication merge
ACM Transactions on Computational Logic (TOCL)
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
A ground-complete axiomatisation of finite-state processes in a generic process algebra
Mathematical Structures in Computer Science
Information and Computation
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Is observational congruence on μ-expressions axiomatisable in equational Horn logic?
Information and Computation
Timed Modal Logics for Real-Time Systems
Journal of Logic, Language and Information
Axiomatizing weak ready simulation semantics over BCCSP
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Advanced mechanisms for service composition, query and discovery
Rigorous software engineering for service-oriented systems
Multi-Linear Iterative K-Σ-Semialgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
A finite basis for failure semantics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Symbolic equivalences for open systems
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
An Algebra of Behavioural Types
Information and Computation
Axiomatizations for probabilistic finite-state behaviors
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
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
A Modal Interface Theory for Component-based Design
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Parameterized Structured Operational Semantics
Fundamenta Informaticae
Atomicity And Concurrency Control In Process Calculi
Fundamenta Informaticae
An Axiomatization for Regular Processes in Timed Branching Bisimulation
Fundamenta Informaticae
Is observational congruence axiomatisable in equational horn logic?
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Theories of Programming and Formal Methods
| Hi-index | 0.01 |