Article

Free access

Derivation of formal representations from process-based specification and implementation models

Authors:

Steven Vercauteren,

Diederik Verkest,

Bill LinAuthors Info & Claims

ISSS '97: Proceedings of the 10th international symposium on System synthesis

Pages 16 - 23

Published: 17 September 1997 Publication History

PDF eReader Publisher Site

Abstract

In this paper we present a method that allows to observe and control the emulation of communicating systems consisting of hardware and software parts. The approach provides the ability to set breakpoints in either technology without breaking the protocol or loosing data. Systems may contain several software and hardware processes. Each process runs in a separate debugger while the presented approach provides the necessary synchronization between the processes that precludes loss of data at the communication interfaces due to breakpoints. Therefore it allows to continue the operation after a breakpoint which is essential for interactive debugging.

References

[1]

J.A. Bergstra andJ.W. Klop. Algebra of Communication Process with Abswaclion. Theoretical Computer Science, 37(1)-77-t21,1985.

[2]

L Bolsens, H. De Man, B. Lin, IC Van Rompaey, S. Vercauteren, and D. Verkest. HardwawJsoftware Co-Design of Digital Telecommunication Systems. Proceedings of the IEEE, 85(3):391-418, March 1997.

[3]

CoWare, 2385 Santa Ann Street, Palo Alto, CA 94303, USA and Kapeldreef 60, B-3001 Heverlee

[4]

L. Phifips L Bolsens and H. De Man. A Programmable CDMA IF Transceiver ASIC for W'treless Communications. In IEEE Custom Integrated Circuits Conference, May 1995.

[5]

J. R. Burch, E. M. Clarke, K. L. McMillan, and D. L. Dill. Sequential Circuit Verification using Symbolic Model Checking. In Proceeding of the 27th ACMIIEEE De.sign Automation Conference, Orlando, June 1990.

Digital Library

[6]

O. Coudext, J. C. Madre, and C. Benhet. Verifying Temporal Properfes of Sequential Machines without building their State Diagrams. In Workshop on Computer-Aided Verification, Rutgers, June 1990.

Digital Library

[7]

G.G. de Jong and Bill Lin- A Communicating Petri Net Model for the Design of Concun'ent Asynchronous Modules. In Proceedings of the 31rdACM/IEEE DesignAut~mation Conference, June ! 994.

Digital Library

[8]

B. Gyselinckx, L. Rijnders, M. Engels, and I. Bolsens. A 4*2.SMchip/s Direct Sequence Spread Spectrum Receiver ASIC with Digital IF and Integrated ARM6 Core. In IEEE Cusiom Integrated Circuits Conference, May 1997.

[9]

C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.

Digital Library

[10]

R. Milner. Communication and Concurreno: Englewood Cliffs, NJ, Prentice Hall, 1981.

Digital Library

[11]

International Standards Organization. LOTOS: a FormalDescription Technique based on the Temporal Ordering of Observa:ional BeRavior. {SO, IS 8807, 1989.

[12]

E. Pastor, O. Roig, J. Cortadella, and R. M. Badia. Petri Net Analysis using Boolean Manipulation. Lecture Notes in Computer Sdeace 815, Springer Verslag, pages 416-435, June ! 994.

Digital Library

[13]

J.L. Peterson Petri Net Theoo" and Modelling of Systems. Prentice Hall, 1981.

Digital Library

[14]

D. Tanbner. Finite Representations of CCS and TCSP Programs by Automata and Peai Nets. Lecture Notes b~ Computer Science 369, June 1989.

Digital Library

[15]

A. Valraafi. A Stubborn A~ack on State Explosion. In 2'~a Wodcshop on Computer Aided Verification, pages 156--165, Hew Brunswick, NJ, June 18-21

Digital Library

[16]

~ BerkeL Handshake Circuits: An Asynchronous Architecture for VLSI Pmgravuning. Cambridge International Series on Parallel Computation, 1993.

Digital Library

[17]

R. van Glabbeek and E Vaandrager. Petri Net Models for Algebraic Theories of Concturency. Proc. of PARLE Ii, Lecture Notes in Computer Science 259, pages 224-242,1987.

Digital Library

[18]

S. Vercauteren. Efficient Detection of Deadlocks Using Generalized Partial Order Analysis. IMEC Internal Technical Report, Reference: IMEC./VSDM/97Mar/Deadloclc/gpo.ps, April 1997.

[19]

S. Vercau~ten and Bill Lin. Hardware/software Communication and System Integration for Embedded Architectures. Design Automation of Embedded S)'sterns, Klmcer Academic Publishers, 2:1-24,1997.

Cited By

Iordache MAntsaklis P(2009)Petri nets and programmingProceedings of the 2009 conference on American Control Conference10.5555/1702715.1703154(4994-4999)Online publication date: 10-Jun-2009
https://dl.acm.org/doi/10.5555/1702715.1703154
Zhu XLin B(1999)Hardware compilation for FPGA-based configurable computing machinesProceedings of the 36th annual ACM/IEEE Design Automation Conference10.1145/309847.310030(697-702)Online publication date: 1-Jun-1999
https://dl.acm.org/doi/10.1145/309847.310030
Vercauteren SVerkest Dde Jong GLin BDewilde PRammig FMusgrave G(1998)Efficient verification using generalized partial order analysisProceedings of the conference on Design, automation and test in Europe10.5555/368058.368415(782-789)Online publication date: 23-Feb-1998
https://dl.acm.org/doi/10.5555/368058.368415
Show More Cited By

Recommendations

A new process algebra more suitable for formal specification
CSSE '21: Proceedings of the 4th International Conference on Computer Science and Software Engineering

The paper shows that some usual specifications cannot be conveniently expressed in traditional process calculi. To solve the problem in formal specification, a new process calculus based on value-passing CCS, Calculus of Communicating Systems with ...
Toward a Formal Semantics for Control-Flow Process Models

A number of information systems have been developed to automate business processes. For process modeling, verification, and automation in information systems, a formal semantics of control-flow process models is needed. Usually process modeling languages ...
Functional specification of probabilistic process models
AAAI'05: Proceedings of the 20th national conference on Artificial intelligence - Volume 2

Agents that handle complex processes evolving over a period of time need to be able to monitor the state of the process. Since the evolution of a process is often stochastic, this requires probabilistic monitoring of processes. A probabilistic process ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ISSS '97: Proceedings of the 10th international symposium on System synthesis

September 1997

141 pages

ISBN:0818679492

Chairmen:
Frank Vahid
Univ. of California, Riverside
,
Francky Catthoor
IMEC, Leuven, Belgium

Copyright © Copyright (c) 1997 Institute of Electrical and Electronics Engineers, Inc. All rights reserved.

Sponsors

SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS: Computer Society

Publisher

IEEE Computer Society

United States

Publication History

Published: 17 September 1997

Check for updates

Qualifiers

Article

Conference

ISSS97

Sponsor:

SIGDA
IEEE-CS

ISSS97: 10th Internatioanl Symposium on System Synthesis

September 17 - 19, 1997

Antwerp, Belgium

Acceptance Rates

Overall Acceptance Rate 38 of 71 submissions, 54%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
339
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)5

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Iordache MAntsaklis P(2009)Petri nets and programmingProceedings of the 2009 conference on American Control Conference10.5555/1702715.1703154(4994-4999)Online publication date: 10-Jun-2009
https://dl.acm.org/doi/10.5555/1702715.1703154
Zhu XLin B(1999)Hardware compilation for FPGA-based configurable computing machinesProceedings of the 36th annual ACM/IEEE Design Automation Conference10.1145/309847.310030(697-702)Online publication date: 1-Jun-1999
https://dl.acm.org/doi/10.1145/309847.310030
Vercauteren SVerkest Dde Jong GLin BDewilde PRammig FMusgrave G(1998)Efficient verification using generalized partial order analysisProceedings of the conference on Design, automation and test in Europe10.5555/368058.368415(782-789)Online publication date: 23-Feb-1998
https://dl.acm.org/doi/10.5555/368058.368415
Lin BDewilde PRammig FMusgrave G(1998)Efficient compilation of process-based concurrent programs without run-time schedulingProceedings of the conference on Design, automation and test in Europe10.5555/368058.368135(211-217)Online publication date: 23-Feb-1998
https://dl.acm.org/doi/10.5555/368058.368135
Lin BChawla BBryant RRabaey J(1998)Software synthesis of process-based concurrent programsProceedings of the 35th annual Design Automation Conference10.1145/277044.277182(502-505)Online publication date: 1-May-1998
https://dl.acm.org/doi/10.1145/277044.277182

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents