On the composition of time Petri nets
DOI10.1007/s10626-011-0102-2zbMath1238.68101OpenAlexW2024286707MaRDI QIDQ645045
Bernard Berthomieu, Florent Peres, François Vernadat
Publication date: 8 November 2011
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-011-0102-2
compositionalitydistributed systemPetri netconcurrencymodel transformationreal time systemtime Petri net
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Characterizing finite Kripke structures in propositional temporal logic
- Bridging the Gap Between Timed Automata and Bounded Time Petri Nets
- Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
- Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets
- Recoverability of Communication Protocols--Implications of a Theoretical Study
- Compositional specification of timed systems
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- Computer Aided Verification
- Formal Modeling and Analysis of Timed Systems
This page was built for publication: On the composition of time Petri nets