SADT: structured analysis and design technique
SADT: structured analysis and design technique
Nonsequential processes
Petri nets and algebraic specifications
Theoretical Computer Science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Interleaved progress, concurrent progress, and local progress
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
The KORSO Case Study for Software Engineering with Formal Methods: A Medical Information System
KORSO - Methods, Languages, and Tools for the Construction of Correct Software
Structured Analysis (SA): A Language for Communicating Ideas
IEEE Transactions on Software Engineering
Modeling of, and reasoning with recurrent events with imprecise durations
IEA/AIE '00 Proceedings of the 13th international conference on Industrial and engineering applications of artificial intelligence and expert systems: Intelligent problem solving: methodologies and approaches
The Temporal Logic of Rewriting: A Gentle Introduction
Concurrency, Graphs and Models
Developer-friendly verification of process-based systems
Knowledge-Based Systems
The linear temporal logic of rewriting Maude model checker
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A dynamic assertion-based verification platform for validation of UML designs
ACM SIGSOFT Software Engineering Notes
A formal model for service-oriented interactions
Science of Computer Programming
State/Event software verification for branching-time specifications
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
A logical verification methodology for service-oriented computing
ACM Transactions on Software Engineering and Methodology (TOSEM)
MAS: qualitative and quantitative reasoning
ProMAS'11 Proceedings of the 9th international conference on Programming Multi-Agent Systems
Fundamenta Informaticae
A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Specifying safety-critical systems with a decidable duration logic
Science of Computer Programming
| Hi-index | 0.00 |
In some phases of system development state-based methods are adequate; in others event-based methods are adequate. Petri nets provide a system model which supports both methods and thus allow a smooth transition between the different phases of system development. Most temporal logics for Petri nets, however, do not support both methods. In this paper we introduce a temporal logic for Petri nets which allows to argue about states as well as to argue about events. This way, specifications in the early phases can be event-based and verification in later phases can be state-based within a single formalism.