Enhanced operational semantics: a tool for describing and analyzing concurrent systems
ACM Computing Surveys (CSUR)
ACM Transactions on Computational Logic (TOCL)
Games and logics for a noninterleaving bisimulation
Nordic Journal of Computing
Independence-friendly modal logic and true concurrency
Nordic Journal of Computing
On Plain and Hereditary History-Preserving Bisimulation
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Hereditary History Preserving Bisimilarity Is Undecidable
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
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
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Weak Bisimilarity and Open Maps
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Compositional Modeling and Verification of Workflow Processes
Business Process Management, Models, Techniques, and Empirical Studies
On the Category of Event Structures with Dense Time
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Behavioural subtyping and property preservation for active objects
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Presheaf models for CCS-like languages
Theoretical Computer Science
Undecidability of domino games and hhp-bisimilarity
Information and Computation
Mathematical Structures in Computer Science
Models for name-passing processes: interleaving and causal
Information and Computation
Towards the hierarchical verification of reactive systems
Theoretical Computer Science - Logic, semantics and theory of programming
Profunctors, open maps and bisimulation
Mathematical Structures in Computer Science
A theory of system behaviour in the presence of node and link failures
CONCUR 2005 - Concurrency Theory
On Compatibility and Behavioural Substitutability of Component Protocols
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Theoretical Computer Science
Decidability of performance equivalence for basic parallel processes
Theoretical Computer Science
Comparing Truly Concurrent Semantics for Contextual Place/Transition Nets
Fundamenta Informaticae
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Causality versus true-concurrency
Theoretical Computer Science
A theory of system behaviour in the presence of node and link failure
Information and Computation
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
Concurrency, Graphs and Models
Parallel and Sequential Independence for Borrowed Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Action Refinement in Process Algebra and Security Issues
Logic-Based Program Synthesis and Transformation
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Information and Computation
Using coupled simulations in non-atomic refinement
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Concurrency can't be observed, asynchronously
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Granularity and concurrent separation logic
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
On the concurrent semantics of algebraic graph grammars
Formal Methods in Software and Systems Modeling
Timed equivalences for timed event structures
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Non-atomic refinement in z and CSP
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Comparing Truly Concurrent Semantics for Contextual Place/Transition Nets
Fundamenta Informaticae
A categorical observation of timed testing equivalence
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |