Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Statecharts: A visual formalism for complex systems
Science of Computer Programming
Information Processing Letters
Complexity results for 1-safe nets
Theoretical Computer Science
Design Automation for Embedded Systems
Formal verification of embedded systems based on CFSM networks
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Formal verification in hardware design: a survey
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Synthesis of embedded software using free-choice Petri nets
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Model checking
Models of computation for embedded system design
System-level synthesis
New methods to color the vertices of a graph
Communications of the ACM
Scheduling of conditional process graphs for the synthesis of embedded systems
Proceedings of the conference on Design, automation and test in Europe
Dual transitions petri net based modelling technique for embedded systems specification
Proceedings of the conference on Design, automation and test in Europe
FunState—an internal design representation for codesign
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Software Specification: A Comparison of Formal Methods
Software Specification: A Comparison of Formal Methods
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to High-Level Synthesis
IEEE Design & Test
Performance Evaluation of Systems Using Nets
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Symbolic model checking of Dual Transition Petri Nets
Proceedings of the tenth international symposium on Hardware/software codesign
Hierarchical Modeling and Verification of Embedded Systems
DSD '01 Proceedings of the Euromicro Symposium on Digital Systems Design
Definitions of Equivalence for Transformational Synthesis of Embedded Systems
ICECCS '00 Proceedings of the 6th IEEE International Conference on Complex Computer Systems
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
A Formal Specification Model for Hardware/Software Codesign
A Formal Specification Model for Hardware/Software Codesign
A case study on process modelling - Three questions and three techniques
Decision Support Systems
Transformations in Reconfigurable Place/Transition Systems
Concurrency, Graphs and Models
Independence of net transformations and token firing in reconfigurable place/transition systems
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Modeling and analysis of scheduling for distributed real-time embedded systems
International Journal of Automation and Computing
Usage of petri nets for high performance computing
Proceedings of the 1st ACM SIGPLAN workshop on Functional high-performance computing
Coverage-directed observability-based validation for embedded software
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Hi-index | 0.00 |
In this paper we concentrate on aspects related to modeling and formal verification of embedded systems. First, we define a formal model of computation for embedded systems based on Petri nets that can capture important features of such systems and allows their representation at different levels of granularity. Our modeling formalism has a well-defined semantics so that it supports a precise representation of the system, the use of formal methods to verify its correctness, and the automation of different tasks along the design process. Second, we propose an approach to the problem of formal verification of embedded systems represented in our modeling formalism. We make use of model checking to prove whether certain properties, expressed as temporal logic formulas, hold with respect to the system model. We introduce a systematic procedure to translate our model into timed automata so that it is possible to use available model checking tools. We propose two strategies for improving the verification efficiency, the first by applying correctness-preserving transformations and the second by exploring the degree of parallelism characteristic to the system. Some examples, including a realistic industrial case, demonstrate the efficiency of our approach on practical applications.