scientific article; zbMATH DE number 557977
From MaRDI portal
Publication:4289659
zbMath0796.68141MaRDI QIDQ4289659
Publication date: 27 April 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
verificationstatesautomataPetri netssemanticsprocess algebrassoftware toolsfixpointsynchronous productfinite transition systemstransition system logics
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (44)
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity ⋮ Weighted automata and weighted logics ⋮ Timed-pNets: a communication behavioural semantic model for distributed systems ⋮ Weighted automata and weighted logics with discounting ⋮ Supervisory control of \((\max,+)\) automata: a behavioral approach ⋮ An algebraic characterization of observational equivalence ⋮ A Normalized Form for FIFO Protocols Traces, Application to the Replay of Mode-based Protocols ⋮ Factorisation of transition systems ⋮ Coinduction in Concurrent Timed Systems ⋮ Weighted Automata and Weighted Logics ⋮ A pseudometric in supervisory control of probabilistic discrete event systems ⋮ Algebraic notions of nontermination: Omega and divergence in idempotent semirings ⋮ Compatibility in a multi-component environment ⋮ Symbolic timing devices ⋮ On the rational behaviors of concurrent timers ⋮ A survey on compositional algorithms for verification and synthesis in supervisory control ⋮ Weighted Automata and Weighted Logics with Discounting ⋮ Unfoldings and Coverings of Weighted Graphs ⋮ Projection approaches to process mining using region-based techniques ⋮ On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic ⋮ On temporal logic versus Datalog ⋮ Articulation of Transition Systems and Its Application to Petri Net Synthesis ⋮ Reaction Systems, Transition Systems, and Equivalences ⋮ Mind the gap: expanding communication options in decentralized discrete-event control ⋮ Scheduling hard sporadic tasks with regular languages and generating functions. ⋮ Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets ⋮ The monadic second-order logic of graphs. IX: Machines and their behaviours ⋮ WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model ⋮ Fixing Zeno gaps ⋮ Automatic Verification of Bossa Scheduler Properties ⋮ Control-invariance of hybrid systems with forcible events ⋮ How expressions can code for automata ⋮ Coupling asynchrony and interrupts: Place Chart Nets ⋮ Bisimulation for labelled Markov processes ⋮ Timed non-interference under partial observability and bounded memory ⋮ A general theory of action languages ⋮ Comparing cospan-spans and tiles via a Hoare-style process calculus ⋮ Weak confluence and \(\tau\)-inertness ⋮ An Overview of Synchronous Communication for Control of Decentralized Discrete-Event Systems ⋮ A Markovian concurrency measure ⋮ On constructibility and unconstructibility of LTS operators from other LTS operators ⋮ Nivat's processes and their synchronization ⋮ Bisimulation indexes and their applications ⋮ Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
This page was built for publication:
