Concurrent Processes and Their Syntax
Journal of the ACM (JACM)
Communicating sequential processes
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Introduction to VLSI Systems
The specification of process synchronization by path expressions
Operating Systems, Proceedings of an International Symposium
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
A model for hardware description and verification
DAC '84 Proceedings of the 21st Design Automation Conference
Using raddle to design distributed systems
ICSE '88 Proceedings of the 10th international conference on Software engineering
Vanna: a visual environment for the design of distributed systems
TRI-Ada '89 Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment
Design by decomposition of multiparty interactions in Raddle87
IWSSD '89 Proceedings of the 5th international workshop on Software specification and design
Process Synchronization: Design and Performance Evaluation of Distributed Algorithms
IEEE Transactions on Software Engineering
The Formal Description and Verification of Hardware Timing
IEEE Transactions on Computers
A comprehensive study of the complexity of multiparty interaction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An approach to multi-paradigm controller synthesis from timing diagram specifications
EURO-DAC '92 Proceedings of the conference on European design automation
A comprehensive study of the complexity of multiparty interaction
Journal of the ACM (JACM)
Multimedia in the E-LOTOS process algebra
Formal methods for distributed processing
An Approach to the Specification and Verification of a Hardware Compilation Scheme
The Journal of Supercomputing
Formal Verification Using Edge-Valued Binary Decision Diagrams
IEEE Transactions on Computers
Compiling Process Algebraic Descriptions into Reconfigurable Logic
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
From Complex Specifications to a Working Prototype. A Protocol Engineering Case Study
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Behavioural Language Compilation with Virtual Hardware Management
FPL '00 Proceedings of the The Roadmap to Reconfigurable Computing, 10th International Workshop on Field-Programmable Logic and Applications
Journal of Systems and Software
Proving testing preorders for process algebra descriptions
EDTC '95 Proceedings of the 1995 European conference on Design and Test
TTL: a modular language for hardware/software systems design
Journal of Computer and System Sciences
Journal of Systems Architecture: the EUROMICRO Journal
Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular
Electronic Notes in Theoretical Computer Science (ENTCS)
Applying formal methods for the design of wireless telecommunication systems
Proceedings of the 3rd international conference on Mobile multimedia communications
Properties as processes: their specification and verification
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Discrete Time Process Algebra: Absolute Time, Relative Time And Parametric Time
Fundamenta Informaticae
Synchronous digital circuits as functional programs
ACM Computing Surveys (CSUR)
Hi-index | 0.01 |
The CIRCAL calculus is presented as a mathematical framework in which to describe and analyze concurrent systems, whether hardware or software.The dot operator is used to compose CIRCAL descriptions, and it is this operator which permits the natural modeling of asynchronous and simultaneous behavior, thus allowing the representation and analysis of system timing properties such as those found in circuits.The CIRCAL framework uses an abstraction operator to permit the modeling of a system at different levels of detail. Behavioral complexity of real systems makes abstraction crucial when producing a tractable model, and we illustrate how abstraction introduces nondeterminisim into system representations.An operational semantics, acceptance semantics, is introduced, and it is in terms of this active experimentation that meaning is given to the CIRCAL syntax, thus allowing proof of system properties to be constructed.