Petri nets: an introduction
A general-purpose algorithm for analyzing concurrent programs
Communications of the ACM
Failures semantics based on interval semiwords is a convergence for refinement
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Refinement of actions in causality based models
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
Designing distributed services using refinement mappings
Designing distributed services using refinement mappings
Temporal proof methodologies for real-time systems
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Unified High-Level Petri Net Formalism for Time-Critical Systems
IEEE Transactions on Software Engineering
Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Guest Editor's Introduction: Formal Methods in Software Engineering
IEEE Transactions on Software Engineering
A Static Analysis of CSP Programs
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Sooner is safer than later.
A formal design notation for real-time systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
Proving Properties of Real-Time Systems Through Logical Specifications and Petri Net Models
IEEE Transactions on Software Engineering
Towards extensible graphical formalisms
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
Merlot: a tool for analysis of real-time specifications
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
| Hi-index | 0.00 |
We describe how formal specifications given in terms of a high-level timed Petri net formalism (TB nets) can be analyzed to check the temporal properties of bounded invariance (the systems stays in a given state until time &tgr;) and bounded response (the system will enter a given state within time &tgr;). In particular, we concentrate on specifications given in a hierarchical, top-down manner, where one specification level refines a more abstract level.Our goal is to define the conditions under which the properties that are proven to hold at a given abstraction level are preserved at the next refined level. To do so, we define the concept of correct refinement, and we show that bounded invariance and bounded response are preserved by a correct refinement. We also provide a set of constructive rules that may be applied to refine a net in such a way that the resulting net is a correct refinement.