Static analysis of real-time component-based systems configurations
Science of Computer Programming - Special issue on coordination languages and architectures
Characterizing Timed Net Processes Categorically
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
A Faster-than Relation for Asynchronous Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Decidability of Strong Bisimilarity for Timed BPP
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Verifying Performance Equivalence for Timed Basic Parallel Processes
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
Proving Correctness of Timed Concurrent Constraint Programs
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Static Analysis of Real-Time Component-Based Systems Configurations
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
A denotational semantics for Timed Linda
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
The expressive power of urgent, lazy and busy-waiting actions in timed processes
Mathematical Structures in Computer Science
Bisimulation on speed: worst-case efficiency
Information and Computation
On the expressiveness of timed coordination models
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Decidability of performance equivalence for basic parallel processes
Theoretical Computer Science
Bisimulation on speed: a unified approach
Theoretical Computer Science
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
A Timed Linda Language and its Denotational Semantics
Fundamenta Informaticae
Observational Equivalences for Timed Stable Event Structures
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Semantic domains of timed event structures
Programming and Computing Software
Timed Mobile Ambients for Network Protocols
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Reasoning about discrete event sources
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Action Refinement for Real-Time Concurrent Processes with Urgency
Electronic Notes in Theoretical Computer Science (ENTCS)
Real-time stable event structures and marked scott domains: an adjunction
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Mobile ambients with timers and types
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Modelling and verification of timed interaction and migration
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Unifying behavioral equivalences of timed transition systems
Programming and Computing Software
Real-time event structures and scott domains
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Bisimulation on speed: a unified approach
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Observational Equivalences for Timed Stable Event Structures
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
A Timed Linda Language and its Denotational Semantics
Fundamenta Informaticae
Analysis of Timed Concurrent Models Based on Testing Equivalence
Fundamenta Informaticae
On the Relationships among four Timed Process Algebras
Fundamenta Informaticae
Parameterized Structured Operational Semantics
Fundamenta Informaticae
| Hi-index | 0.00 |