Showing papers by "Grzegorz Rozenberg published in 1992"
TL;DR: An old-fashioned recipe for real time verifying automata specifications of probabilistic real-time systems and a specification of the cat and mouse problem.
Abstract: An old-fashioned recipe for real time.- Verifying automata specifications of probabilistic real-time systems.- The theory of timed automata.- Logics and models of real time: A survey.- The state operator in real time process algebra.- Timed process algebras with urgent interactions and a unique powerful binary operator.- Time in state based formal description techniques for distributed systems.- Real-time and the Mu-Calculus (preliminary report).- Implementing reactive programs on circuits a hardware implementation of LUSTRE.- Semantics and completeness of Duration Calculus.- Timed transition systems.- Compositional verification of real-time systems using extended Hoare triples.- Semantics of reactive systems in abstract time.- Problems, promises and performance: some questions for real-time system specification.- Abstraction in real time process algebra.- (Real) time: A philosophical perspective.- Specification and analysis of resource-bound real-time systems.- Forward and backward simulations for timing-based systems.- Prom timed to hybrid systems.- Coping with implementation dependencies in real-time system verification.- Validating real-time systems by executing logic specifications.- An overview and synthesis on timed process algebras.- From ATP to timed graphs and hybrid systems.- Verification of safety critical systems using TTM/RTTL.- Predicative specification of timed processes.- Putting time into proof outlines.- Timed CSP: Theory and practice.- A specification of the cat and mouse problem.- Layering and action refinement for timed systems.
304 citations
TL;DR: There is a natural way of associating a transition system with each elementary net system in order to explain the operational behaviour of elementary net systems in purely sequential terms.
166 citations
01 Jan 1992
TL;DR: This paper surveys various notions of equivalence for concurrent systems in the framework of Elementary Net Systems, a fundamental class in the family of Petri Net models.
Abstract: This paper surveys various notions of equivalence for concurrent systems in the framework of Elementary Net Systems, a fundamental class in the family of Petri Net models. Two types of equivalences are considered: equivalences based on observations of actions defined in the framework of interleaving, step and partial order semantics; and equivalences based on state spaces and state observability.
142 citations
Book•
01 Jan 1992
TL;DR: Design methods based on nets with modular functional modelling of petri nets with individual tokens and a survey of equivalence notions for net based systems.
Abstract: Esprit basic research action 3148 DEMON (Design methods based on nets) - Aims, scope and achievements -.- The box calculus: A new causal algebra with multi-label communication.- Modular functional modelling of petri nets with individual tokens.- Interleaving semantics and action refinement with atomic choice.- Maximality preservation and the ST-idea for action refinements.- A fifo-net model for processes with asynchronous communication.- A basic-net algebra for program semantics and its application to occam.- The effect of Vector synchronization: Residue and loss.- Modelling systems with dynamic priorities.- On distributed languages and models for concurrency.- Partial words versus processes: A short comparison.- A survey of basic net models and modular net classes.- Structural techniques and performance bounds of stochastic Petri net models.- A survey of recognizable languages of infinite traces.- A survey of equivalence notions for net based systems.
49 citations
[...]
TL;DR: This paper investigates the class of angular 2-structures which results by requiring that the primitivity is forbidden on the lowest possible level, i.e. it is required that no substructure on three elements is primitive.
19 citations
TL;DR: The results show that the more abstract-but essentially equivalent-model of elementary transition systems is the appropriate framework for theoretical studies concerning refinement operations for elementary net systems.
Abstract: Elementary transition systems are-in a strong categorical sense-the transition system version of a basic system model of net theory called elementary net systems. The structural notion of a region associated with elementary transition systems captures the intuitive idea of a local state as modelled by the conditions of an elementary net system. In this paper we equip elementary transition systems with a refinement operation over the local states (regions). We then show our operation satisfies a number of interesting properties. In particular, this operation supports compositional reasoning. It is very hard if not impossible to define a corresponding operation at the level of nets which enjoys similar properties. This is due to the concrete choice of conditions used to enforce intended behaviour. Thus our results show that the more abstract-but essentially equivalent-model of elementary transition systems is the appropriate framework for theoretical studies concerning refinement operations for elementary net systems.
16 citations