A Faster-than Relation for Asynchronous Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Located actions in process algebra with timing
Fundamenta Informaticae
Solving scheduling problems by untimed model checking: the clinical chemical analyser case study
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
A translation of TPALp into a class of timed-probabilistic Petri nets
Theoretical Computer Science
A brief history of process algebra
Theoretical Computer Science - Process algebra
Process algebra for hybrid systems
Theoretical Computer Science - Process algebra
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
A Synchronous Process Calculus for Service Costs
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Specification, testing and implementation relations for symbolic-probabilistic systems
Theoretical Computer Science
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)
Bisimulation on speed: a unified approach
Theoretical Computer Science
Process Algebra with Nonstandard Timing
Fundamenta Informaticae
Real-time rewriting semantics of orc
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi
Electronic Notes in Theoretical Computer Science (ENTCS)
Reduction Semantics and Formal Analysis of Orc Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed Extended Beam Search for Quantitative Model Checking
Model Checking and Artificial Intelligence
Lost in Translation: Hybrid-Time Flows vs. Real-Time Transitions
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Extending Timed Process Algebra with Discrete Stochastic Time
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Is Timed Branching Bisimilarity a Congruence Indeed?
Fundamenta Informaticae
Formal specification and analysis of hardware systems in timed Chi
Nordic Journal of Computing
Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Transmission Protocols for Instruction Streams
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Fundamenta Informaticae - Application of Concurrency to System Design
Modeling time in computing: A taxonomy and a comparative survey
ACM Computing Surveys (CSUR)
A Hierarchy of SOS Rule Formats
Electronic Notes in Theoretical Computer Science (ENTCS)
Notions of bisimulation and congruence formats for SOS with data
Information and Computation
Mathematical modelling of digital hardware systems in timed Chi
MIC '07 Proceedings of the 26th IASTED International Conference on Modelling, Identification, and Control
Impossibility results for the equational theory of timed CCS
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Formal testing of systems presenting soft and hard deadlines
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Action abstraction in timed process algebra: the case for an untimed silent step
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Is observational congruence on μ-expressions axiomatisable in equational Horn logic?
Information and Computation
A comparative study of STOPA and RTPA
Transactions on computational science II
On Rule Formats for Zero and Unit Elements
Electronic Notes in Theoretical Computer Science (ENTCS)
An exercise in iterative domain-specific language design
Proceedings of the Joint ERCIM Workshop on Software Evolution (EVOL) and International Workshop on Principles of Software Evolution (IWPSE)
Time abstraction in timed µCRL à la regions
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Suitability of mCRL2 for concurrent-system design: a 2 × 2 switch case study
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Testing timed systems modeled by Stream X-machines
Software and Systems Modeling (SoSyM)
Embedding real time in stochastic process algebras
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Is timed branching bisimilarity an equivalence indeed?
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Rule formats for determinism and idempotence
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
A categorical view of timed weak bisimulation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Testing of symbolic-probabilistic systems
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Timing the untimed: terminating successfully while being conservative
Processes, Terms and Cycles
Model theory for process algebra
Processes, Terms and Cycles
SAT-based verification for timed component connectors
Science of Computer Programming
Fundamenta Informaticae - Cognitive Informatics, Cognitive Computing, and Their Denotational Mathematical Foundations (I)
Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Fundamenta Informaticae - Application of Concurrency to System Design
Is Timed Branching Bisimilarity a Congruence Indeed?
Fundamenta Informaticae
Located Actions in Process Algebra with Timing
Fundamenta Informaticae
Process Algebra with Nonstandard Timing
Fundamenta Informaticae
The saga of the axiomatization of parallel composition
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Is observational congruence axiomatisable in equational horn logic?
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
A Process Calculus with Finitary Comprehended Terms
Theory of Computing Systems
Hi-index | 0.00 |
From the Publisher:Timing issues are of growing importance for the conceptualization and design of computer-based systems. Timing may simply be essential for the correct behaviour of a system, e.g. of a controller. Even if timing is not essential for the correct behaviour of a system, there may be good reasons to introduce it in such a way that suitable timing becomes relevant for the correct behaviour of a complex system. This book is unique in presenting four algebraic theories about processes, each dealing with timing from a different point of view, in a coherent and systematic way. The timing of actions is either relative or absolute and the underlying time scale is either discrete or continuous. All presented theories are extensions of the algebra of communicating processes. The book is essential reading for researchers and advanced students interested in timing issues in the context of the design and analysis of concurrent and communicating processes.