Software Engineering and Petri Nets

This booklet contains the proceedings of the Workshop on Software Engineering and Petri Nets (SEPN), held on June 26, 2000. The workshop was held in conjunction with the 21st International Conference on Application and Theory of Petri Nets (ICATPN-2000), organised by the CPN group of the Department of Computer Science, University of Aarhus, Denmark. The SEPN workshop papers are available in electronic form via the web page:http://www.daimi.au.dk/pn2000/proceeding

Improving explicit model checking for Petri nets

Model checking is the automated verification that systematically checks if a given behavioral property holds for a given model of a system. We use Petri nets and temporal logic as formalisms to describe a system and its behavior in a mathematically precise and unambiguous manner. The contributions of this thesis are concerned with the improvement of model checking efficiency both in theory and in practice. We present two new reduction techniques and several supplementary strength reduction techniques. The thesis also enhances partial order reduction for certain temporal logic classes

Second Workshop on Practical Use of Coloured Petri Nets and Design/CPN.

This report contains the proceedings of the Second Workshop on Practical Use of Coloured Petri Nets and Design/CPN, October 13-15, 1999. The workshop was organised by the CPN group at the Department of Computer Science at the University of Aarhus, Denmark. The individual papers are available in electronic form via the web pages: http://www.daimi.au.dk/CPnets/workshop99

Doctor of Philosophy

dissertationOver the last decade, cyber-physical systems (CPSs) have seen significant applications in many safety-critical areas, such as autonomous automotive systems, automatic pilot avionics, wireless sensor networks, etc. A Cps uses networked embedded computers to monitor and control physical processes. The motivating example for this dissertation is the use of fault- tolerant routing protocol for a Network-on-Chip (NoC) architecture that connects electronic control units (Ecus) to regulate sensors and actuators in a vehicle. With a network allowing Ecus to communicate with each other, it is possible for them to share processing power to improve performance. In addition, networked Ecus enable flexible mapping to physical processes (e.g., sensors, actuators), which increases resilience to Ecu failures by reassigning physical processes to spare Ecus. For the on-chip routing protocol, the ability to tolerate network faults is important for hardware reconfiguration to maintain the normal operation of a system. Adding a fault-tolerance feature in a routing protocol, however, increases its design complexity, making it prone to many functional problems. Formal verification techniques are therefore needed to verify its correctness. This dissertation proposes a link-fault-tolerant, multiflit wormhole routing algorithm, and its formal modeling and verification using two different methodologies. An improvement upon the previously published fault-tolerant routing algorithm, a link-fault routing algorithm is proposed to relax the unrealistic node-fault assumptions of these algorithms, while avoiding deadlock conservatively by appropriately dropping network packets. This routing algorithm, together with its routing architecture, is then modeled in a process-algebra language LNT, and compositional verification techniques are used to verify its key functional properties. As a comparison, it is modeled using channel-level VHDL which is compiled to labeled Petri-nets (LPNs). Algorithms for a partial order reduction method on LPNs are given. An optimal result is obtained from heuristics that trace back on LPNs to find causally related enabled predecessor transitions. Key observations are made from the comparison between these two verification methodologies

Redes de Petri reactivas e hierárquicas - integração de formalismos no projecto de sistemas reactivos de tempo-real

Dissertação apresentada para obtenção do grau de Doutor em Engenharia Electrotécnica, especialidade de Sistemas Digitais, pela Universidade Nova de Lisboa, Faculdade de Ciências e TecnologiaNesta dissertação faz-se a apresentação de uma nova classe de Redes de Petri, as Redes de Petri Reactivas e Hierárquicas (RdP-RH). O objectivo principal da proposta é o de suportar o projecto integrado de sistemas reactivos de tempo-real, permitindo, para além do apoio às diversas fases do ciclo de desenvolvimento, nomeadamente especificação, validação, verificação e realização, integrar submodelos especificados através de diferentes formalismos. Como exemplos representativos de sistemas reactivos de tempo-real refiram-se os sistemas embebidos, os sistemas de automação e os circuitos digitais de aplicação específica. De entre os formalismos tidos como interessantes, refiram-se, os formalismos típicos de especificação dos sistemas a eventos discretos passíveis de uma representação gráfica, como as máquinas de estado, os statecharts e as redes de Petri, bem como alguns dos formalismos genericamente designados como de controlo inteligente, como sistemas de produção de regras, de regras com imprecisão e de regras difusas. A classe das Redes de Petri Reactivas (RdP-R), utilizada como núcleo das RdP-RH, é caracterizada como tomando as Redes de Petri Coloridas como classe de referência, às quais se adicionam capacidades de modelação de características não-autónomas, intrínsecas aos sistemas que se pretendem modelar. Discutem-se alguns aspectos ligados à sua realização, nomeadamente os temas de construção do espaço de estados e da resolução automática de conflitos. A introdução de três mecanismos distintos de estruturação hierárquica, denominados por decomposição horizontal, vertical e mista, conduz à definição das RdP-RH. Nelas se utilizam três tipos de nós denominados por macronós, metanós e supernós, associados aos três mecanismos propostos. Os mecanismos de estruturação hierárquica do modelo são complementados com a representação vectorizada dos nós do grafo. Discute-se a aplicação das RdP-RH na modelação de statecharts e de formalismos de controlo inteligente, com ênfase para os controladores difusos, onde a necessidade de integrar controlo e processamento de dados permite utilizar cabalmente as capacidades das RdP-RH. Em torno da análise de trabalhos realizados na área de aplicação de “edifícios inteligentes”, utilizada como referência para o trabalho desenvolvido, identificam-se alguns temas em que se prevêm ou são desejados desenvolvimentos no futuro próximo recorrendo às RdP-RH

Tools and Algorithms for the Construction and Analysis of Systems

This open access two-volume set constitutes the proceedings of the 26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The total of 60 regular papers presented in these volumes was carefully reviewed and selected from 155 submissions. The papers are organized in topical sections as follows: Part I: Program verification; SAT and SMT; Timed and Dynamical Systems; Verifying Concurrent Systems; Probabilistic Systems; Model Checking and Reachability; and Timed and Probabilistic Systems. Part II: Bisimulation; Verification and Efficiency; Logic and Proof; Tools and Case Studies; Games and Automata; and SV-COMP 2020